An optimal speed-up parallel algorithm for triangulating simplicial point sets in space
- 1 October 1986
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 15 (5) , 389-398
- https://doi.org/10.1007/bf01414463
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient plane sweeping in parallelPublished by Association for Computing Machinery (ACM) ,1986
- Triangulating simplicial point sets in spacePublished by Association for Computing Machinery (ACM) ,1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Parallel computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Visibility-polygon search and euclidean shortest pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Automatic triangulation of arbitrary planar domains for the finite element methodInternational Journal for Numerical Methods in Engineering, 1974