y.layout.router.polyline
Interface Partition

All Known Subinterfaces:

ObstaclePartition

All Known Implementing Classes:

DynamicObstacleDecomposition, GraphPartition

public interface Partition

This class divides a rectangular area into one or more PartitionCells. PartitionCells have to be disjoint. The union of all PartitionCells covers the original area.

Method Summary

YRectangle	getBounds() Returns the bounds of the original rectangular area that is partitioned.
java.util.List	getCells(YRectangle rect) Returns a list of all PartitionCells that intersect or cover the given rectangle.
java.util.List	getNeighbors(PartitionCell cell) 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.

Method Detail

getNeighbors

java.util.List getNeighbors(PartitionCell cell)

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:

cell - the cell whose neighbors will be returned

Returns:

a list of PartitionCells that are neighbors of the given cell

getCells

java.util.List getCells(YRectangle rect)

Returns a list of all PartitionCells that intersect or cover the given rectangle.

Parameters:

rect - the rectangular area whose (partially) covered cells will be returned

Returns:

a list of PartitionCells that (partially) cover the given rectangular area

getBounds

YRectangle getBounds()

Returns the bounds of the original rectangular area that is partitioned.

Returns:

the bounds of the original rectangular area