An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane

[1]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[2]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[3]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[4]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[5]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .