A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
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