Computing the extreme distances between two convex polygons
- 30 June 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (2) , 213-224
- https://doi.org/10.1016/0196-6774(85)90039-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Efficient algorithms for computing the maximum distance between two finite planar setsJournal of Algorithms, 1983
- Finding the minimum distance between two convex polygonsInformation Processing Letters, 1981
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979