Implementations of this interface use RoutingObstacles as input to subdivide an area into PartitionCells for the path search algorithm of the EdgeRouter.
Inheritance Hierarchy
IRouterPartition
Remarks
PartitionCells have to be disjoint. The union of all PartitionCells covers the original area.
Type Details
- yFiles module
- algorithms
Properties
Gets the bounds of the original rectangular area that is partitioned.
Property Value
The bounds of the original rectangular area
Methods
Returns all PartitionCells that are completely covered by the given RoutingObstacle.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- obstacle - RoutingObstacle
- The obstacle for which the covered cells will be returned
Returns
- ↪IList<PartitionCell>
- A list of PartitionCell instances that are completely covered by the given obstacle
Returns a list of all PartitionCells that intersect or cover the given rectangle.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- rect - Rect
- The rectangular area whose (partially) covered cells will be returned
Returns
- ↪IList<PartitionCell>
- A list of PartitionCells that (partially) cover the given rectangular area
Returns a list of all PartitionCells that are neighbors of the given cell, i.e., those cells that have a common border segment with the given cell.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- cell - PartitionCell
- The cell whose neighbors will be returned
Returns
- ↪IList<PartitionCell>
- A list of PartitionCells that are neighbors of the given cell
Returns all RoutingObstacles that cover the given PartitionCell.
Parameters
options - Object
A map of options to pass to the method.
A map of options to pass to the method.
- cell - PartitionCell
- The partition cell for which the obstacles will be returned
Returns
- ↪IList<RoutingObstacle>
- A list of RoutingObstacle instances that cover the given cell