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.
Unable to display preview. Download preview PDF.
- B. Baker, E. Grosse, and C. Rafferty. Nonobtuse triangulation of polygons. Discrete Comput. Geom. 3 (1988) 147–168.Google Scholar
- O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. 21st Symp. Theory of Computing (1989) 309–319.Google Scholar
- M. Bern, D. Eppstein, and J.R. Gilbert. Provably good mesh generation. 31st Symp. Found. Comput. Sci. (1990) 231–241. To appear in J. Comp. Sys. Sci. Google Scholar
- M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In Euclidean Geometry and the Computer, World Scientific, 1992.Google Scholar
- L.P. Chew. Guaranteed-quality triangular meshes. TR-89-983, Cornell, 1989.Google Scholar
- R. Cole and U. Vishkin. Optimal parallel algorithms for expression tree evaluation and list ranking. 3rd Aegean Workshop on Computing, Springer LNCS 319 (1988).Google Scholar
- D. Eppstein. Approximating the minimum weight triangulation. 3rd Symp. Discrete Algorithms (1992) 48–57. To appear in Discrete Comput. Geom. Google Scholar
- M.L. Fredman and D.E. Willard. Blasting through the information-theoretic barrier with fusion trees. 22nd Symp. Theory of Computing (1990) 1–7.Google Scholar
- E.A. Melissaratos and D.L. Souvaine. Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes. 8th Symp. Comput. Geom. (1992) 202–211.Google Scholar
- S.A. Mitchell and S.A. Vavasis. Quality mesh generation in three dimensions. 8th Symp. Comput. Geom. (1992) 212–221.Google Scholar
- J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. 4th Symp. Discrete Algorithms (1993) 83–92.Google Scholar
- D.E. Willard. Applications of the fusion tree method to computational geometry and searching. 3rd Symp. Discrete Algorithms (1992) 286–295.Google Scholar
- R.D. Williams. Adaptive parallel meshes with complex geometry. Tech. Report CRPC-91-2, Center for Research on Parallel Computation, Cal. Tech.Google Scholar