An optimal parallel algorithm for triangulating a set of points in the plane

This publication has 8 references indexed in Scilit:

• An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
  International Journal of Parallel Programming, 1986
• The power of parallel prefix
  IEEE Transactions on Computers, 1985
• Visibility-polygon search and euclidean shortest paths
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Sorting inc logn parallel steps
  Combinatorica, 1983
• On parallel searching (Extended Abstract)
  Published by Association for Computing Machinery (ACM) ,1982
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
  IEEE Transactions on Computers, 1980
• Parallelism in random access machines
  Published by Association for Computing Machinery (ACM) ,1978
• Automatic triangulation of arbitrary planar domains for the finite element method
  International Journal for Numerical Methods in Engineering, 1974