We describe efficient PRAM algorithms for constructing unbalanced quadtrees
, balanced quadtrees, and quadtree-based finite element meshes. Our algorit
hms take time O(log n) for point set input and O(bg n log Ic) time For plan
ar straight-line graphs, using O(n + k log n) processors, where n measures
input size and k output size.