Parallel construction of quadtrees and quality triangulations

International Journal of Computational Geometry and Applications

Volumn 9, Issue 6, 1999, Pages 517-532

  Bern, Marshall ^a   Eppstein, David ^b   Teng, Shang Hua ^c  

^a PALO ALTO RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Fair split tree; Mesh generation; Nonobtuse triangulation; Parallel algorithms; PRAM model; Quadtree

Indexed keywords

EID: 0033259379     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000303     Document Type: Article

References (25)

1. B. Baker, E. Grosse, and C. Rafferty. Nonobtuse triangulation of polygons. Disc. Comput. Geom. 3:147-168, 1988.
2. L. P. Chew. Guaranteed-quality triangular meshes. Tech. Rep. TR-89-983, Cornell Univ., Dept. of Computer Science, 1989.
3. M. Bern, D. Eppstein, and J. R. Gilbert. Provably good mesh generation. J. Comp. Sys. Sci. 48:384-409, 1994.
4. D. Eppstein. Approximating the minimum weight Steiner triangulation. Disc. Comput. Geom. 11:163-191, 1994.
5. E. A. Melissaratos and D. L. Souvaine. Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes. 8th ACM Symp. Comp. Geom., pp. 202-211, 1992.
6. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in three dimensions. 8th ACM Symp. Comp. Geom., pp. 212-221, 1992.
7. J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. 4th ACM-SIAM Symp. Discrete Algorithms, pp. 83-92, 1993.
8. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. Computing in Euclidean Geometry, 2nd edition, pp. 47-123. World Scientific, Lecture Notes Ser. Comput. 4, 1995.
9. M. T. Jones and P. E. Plassman. Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes. Scalable High-Performance Computing Conf., pp. 478-485, 1994.
10. R. Lohner, J. Camberos, and M. Merriam. Parallel unstructured grid generation. Comp. Meth. Appl. Mech. Eng. 95:343-357, 1992.
11. R. D. Williams. Adaptive parallel meshes with complex geometry. Tech. Rep. CRPC-91-2, Cal. Tech., Ctr. for Research on Parallel Computation, 1991.
12. H. Samet. The quadtree and related hierarchical data structures. ACM Computing Surveys 16:188-260, 1984.
13. I. Gargantini. An effective way to represent quadtrees. Commun. ACM 25:905-910, 1982.
14. P. B. Callahan. Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. 34th IEEE Symp. Found. Comp. Sci., pp. 332-340, 1993.
15. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. 5th ACM-SIAM Symp. Discrete Algorithms, pp. 573-582, 1994.
16. D. M. Mount and S. Arya. Approximate range searching. 11th ACM Symp. Comp. Geom., pp. 172-181, 1995.
17. S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. 38th IEEE Symp. Found. Comp. Sci., pp. 554-563, 1997.
18. M. L. Fredman and D. E. Willard. Surpassing the information-theoretic bound with fusion trees. J. Comp. Sys. Sci. 47:424-436, 1993.
19. D. E. Willard. Applications of the fusion tree method to computational geometry and searching. 3rd ACM-SIAM Symp. Discrete Algorithms, pp. 286-295, 1992.
20. D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comp. Sci. 3:233-283, 1988.
21. R. Cole. Parallel merge sort. SIAM J. Comput. 17:770-785, 1988.
22. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. 21st ACM Symp. Theory of Computing, pp. 309-319, 1989.
23. R. P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM 21:201-206, 1974.
24. M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: a technique for designing parallel algorithms. SIAM J. Comput. 18:499-532, 1989.
25. R. Cole and U. Vishkin. Optimal parallel algorithms for expression tree evaluation and list ranking. 3rd Aegean Worksh. Comput. Springer-Verlag, Lecture Notes in Comp. Sci. 319, 1988.