Parallel algorithms for some functions of two convex polygons
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4) , 535-548
- https://doi.org/10.1007/bf01762130
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Efficient parallel solutions to some geometric problemsJournal of Parallel and Distributed Computing, 1986
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Parallel computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Bounds on the time for parallel RAM's to compute simple functionsPublished by Association for Computing Machinery (ACM) ,1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Detection is easier than computation (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1980
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977