Computing the intersection-depth of polyhedra
- 1 June 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (6) , 518-533
- https://doi.org/10.1007/bf01190153
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Determining the separation of preprocessed polyhedra — A unified approachPublished by Springer Nature ,2005
- A linear-time algorithm for computing the voronoi diagram of a convex polygonDiscrete & Computational Geometry, 1989
- Ray shooting and other applications of spanning trees with low stabbing numberPublished by Association for Computing Machinery (ACM) ,1989
- Intersection of convex objects in two and three dimensionsJournal of the ACM, 1987
- Polygon containment under translationJournal of Algorithms, 1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar PolygonsIEEE Transactions on Computers, 1983
- Fast detection of polyhedral intersectionsPublished by Springer Nature ,1982
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979