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.

• Type: Conference
• Year: 1993
• Where: WADS
• Authors: Marshall W. Bern, David Eppstein, Shang-Hua Teng
• Keywords: Algorithms, Efficient Pram Algorithms, Planar Straight-line Graphs, WADS 1993, finite Element Meshes