An O(log n) time parallel algorithm for triangulating a set of points in the plane
- 20 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1) , 55-60
- https://doi.org/10.1016/0020-0190(87)90093-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975