Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 126.96.36.199
Implementations have to satisfy the following condition for each pair of obstacle and partition cell:
Obstacles either completely cover partition cells or do not intersect partition cells at all.
Fig 1: Example of an obstacle partition of a graph consisting of two gray colored nodes connected by one edge. The two nodes are considered to be obstacles. The blue colored partition cells subdivide the area such that each obstacle either completely covers a partition cell or do not intersect with a partition cell.