Parallel Construction of Quadtrees and Quality Triangulations

We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straight-line graphs, using O(n+k/log n) processors, where n measures input size and k output size.

[1]  Mark T. Jones,et al.  Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[2]  Dan E. Willard,et al.  Applications of the fusion tree method to computational geometry and searching , 1992, SODA '92.

[3]  Elefterios A. Melissaratos,et al.  Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes , 1992, SCG '92.

[4]  Jim Ruppert,et al.  A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[5]  Roy Williams,et al.  Adaptive Parallel Meshes with Complex Geometry , 1991 .

[6]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Rainald Loehner,et al.  Parallel unstructured grid generation , 1991 .

[8]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[9]  Richard Cole,et al.  Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms , 1987, FOCS.

[10]  Richard Cole,et al.  Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking , 1988, AWOC.

[11]  Sunil Arya,et al.  Approximate range searching , 1995, SCG '95.

[12]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[13]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[15]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

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

[17]  Uzi Vishkin,et al.  Highly parallelizable problems , 1989, STOC '89.

[18]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[19]  Brenda S. Baker,et al.  Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..

[20]  David Eppstein,et al.  Approximating the minimum weight triangulation , 1992, SODA '92.

[21]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[22]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[23]  Paul B. Callahan.  Optimal parallel all-nearest-neighbors using the well-separated pair decomposition , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[24]  David Eppstein.  Approximating the minimum weight steiner triangulation , 1994, Discret. Comput. Geom..

[25]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[26]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.