Efficient algorithms for computing the maximum distance between two finite planar sets
- 30 June 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (2) , 121-136
- https://doi.org/10.1016/0196-6774(83)90040-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Über Algorithmen mit mittlerem linearen Zeitbedarf zur Bestimmung der konvexen HülleComputing, 1981
- A note on finding convex hulls via maximal vectorsInformation Processing Letters, 1980
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- On the Average Number of Maxima in a Set of Vectors and ApplicationsJournal of the ACM, 1978
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- ZufÄllige konvexe Polygone in einem RinggebietProbability Theory and Related Fields, 1968
- Hierarchical clustering schemesPsychometrika, 1967
- ber die konvexe H lle von n zuf llig gew hlten Punkten. IIProbability Theory and Related Fields, 1964
- ber die konvexe H lle von n zuf llig gew hlten PunktenProbability Theory and Related Fields, 1963