Planar Separators and Parallel Polygon Triangulation

Abstract We show how to construct an O(√n)-separator decomposition of a planar graph G in O(n) time. Such a decomposition defines a binary tree, where each node corresponds to a subgraph of G and stores an O(√n)-separator of that subgraph. We also show how to construct an O(nϵ)-way decomposition tree in parallel in O(log n) time so that each node corresponds to a subgraph of G and stores an O(n12+ϵ)-separator of that subgraph. We demonstrate the utility of such a separator decomposition by showing 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.

[1]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[2]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[3]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[5]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[6]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[7]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[8]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[9]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[10]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[11]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[12]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[13]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[14]  Gary L. Miller,et al.  Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[15]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[16]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[17]  Gary L. Miller,et al.  A parallel algorithm for finding a separator in planar graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[18]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[19]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[20]  Robert E. Tarjan,et al.  An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[21]  Michael T. Goodrich,et al.  Triangulating a Polygon in Parallel , 1989, J. Algorithms.

[22]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[23]  Richard Cole,et al.  An Optimal Parallel Algorithm for Building a Data Structure for Planar Point Location , 1990, J. Parallel Distributed Comput..

[24]  David G. Kirkpatrick,et al.  Polygon triangulation in O(n log log n) time with simple data-structures , 1990, SCG '90.

[25]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[26]  Kenneth L. Clarkson,et al.  Randomized parallel algorithms for trapezoidal diagrams , 1991, SCG '91.

[27]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[28]  David Eppstein,et al.  Separator based sparsification for dynamic planar graph algorithms , 1993, STOC '93.

[29]  John Hershberger.  Optimal parallel algorithms for triangulated simple polygons , 1995, Int. J. Comput. Geom. Appl..

[30]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.