Parallel construction of quadtrees and quality triangulations [chapter]

Marshall Bern, David Eppstein, Shang-Hua Teng
1993 Lecture Notes in Computer Science  
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.
doi:10.1007/3-540-57155-8_247 fatcat:52u2vtkaxvczphwwwjkznqagsy