|
Search this API | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface ObstaclePartition
This class implements a Partition
that takes a list of Obstacle
s as input to subdivide an area into
PartitionCell
s.
Implementations have to satisfy the following condition for each pair of Obstacle
and PartitionCell
:
Obstacle
s either completely cover PartitionCell
s or do not intersect PartitionCell
s at all.ObstaclePartition
of a graph consisting of two nodes connected by one edge.
The two nodes are considered to be obstacles. The colored partition cells subdivide the area such that
each obstacle either completely covers a partition cell or does not intersect with a partition cell.
Method Summary | |
---|---|
void |
clear()
Clears the partition data such that the ObstaclePartition can be reused and
initialized with new Obstacle s. |
java.util.List |
getCells(Obstacle obstacle)
Returns all PartitionCell s that are completely covered by the given Obstacle . |
java.util.List |
getObstacles(PartitionCell cell)
Returns all Obstacle s that cover the given PartitionCell . |
void |
init(java.util.List obstacles,
YRectangle bounds)
Initializes a new ObstaclePartition of the area with the given bounds using the given list of
Obstacle s. |
Methods inherited from interface y.layout.router.polyline.Partition |
---|
getBounds, getCells, getNeighbors |
Method Detail |
---|
void init(java.util.List obstacles, YRectangle bounds)
ObstaclePartition
of the area with the given bounds using the given list of
Obstacle
s.
Unused partitions must be cleared using method clear()
.
obstacles
- a list of Obstacle
s that have to be considered by the partitionbounds
- the bounds of the partitionclear()
java.util.List getObstacles(PartitionCell cell)
Obstacle
s that cover the given PartitionCell
.
cell
- the partition cell for which the obstacles will be returned
Obstacle
instances that cover the given celljava.util.List getCells(Obstacle obstacle)
PartitionCell
s that are completely covered by the given Obstacle
.
obstacle
- the obstacle for which the covered cells will be returned
PartitionCell
instances that are completely covered by the given obstaclevoid clear()
ObstaclePartition
can be reused and
initialized
with new Obstacle
s.
init(List, YRectangle)
|
© Copyright 2000-2022, yWorks GmbH. All rights reserved. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |