y.layout.router.polyline
Interface Partition

All Known Subinterfaces:

ObstaclePartition

All Known Implementing Classes:

DynamicObstacleDecomposition, GraphPartition

public interface Partition

Divides a rectangular area into one or more PartitionCells. Partition cells have to be disjoint. The union of all partition cells covers the original area.

Method Summary

YRectangle	getBounds() The rectangular area that is partitioned.
List	getCells(YRectangle rect) Returns a list of all PartitionCells that intersect or cover the given rectangle.
List	getNeighbors(PartitionCell cell) Returns a list of all PartitionCells that are neighbors of the given cell, this means those cells have a common border segment with the given cell.

Method Detail

getNeighbors

List getNeighbors(PartitionCell cell)

Returns a list of all PartitionCells that are neighbors of the given cell, this means those cells have a common border segment with the given cell.

Parameters:

cell - The cell to get the neighbors for.

Returns:

A list of PartitionCells that are neighbors of the given cell.

getCells

List getCells(YRectangle rect)

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

Parameters:

rect - The rectangular area to get (partially) covered cells for.

Returns:

A list containing (partially) covered PartitionCells.

getBounds

YRectangle getBounds()

The rectangular area that is partitioned.

Returns:

The bounds of the original rectangular area.