Parallel computational geometry
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4), 293-327
- https://doi.org/10.1007/bf01762120
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Cascading divide-and-conquer: A technique for designing parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Geometric applications of a matrix searching algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Efficient plane sweeping in parallelPublished by Association for Computing Machinery (ACM) ,1986
- Minimum area circumscribing PolygonsThe Visual Computer, 1985
- Finding Extremal PolygonsSIAM Journal on Computing, 1985
- Computational GeometryPublished by Springer Nature ,1985
- The complexity of elementary algebra and geometryPublished by Association for Computing Machinery (ACM) ,1984
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974