)-separator of that subgraph. We demonstrate the utility of such a separator decomposition by s h o wing how it can be used in the design of a parallel algorithm for triangulating a simple polygon deterministically in O(log n) time using O(n= log n) processors on a CRCW PRAM.
Goodrich REF shows that recursive O( √ n)-separator decompositions can be constructed for planar graphs in O(n) time.
Planar Separators and Parallel Polygon Triangulation
J. Comput. Syst. Sci.
J. Comput. Syst. Sci.
Mathematics Computer Science