Efficient algorithms for computing the maximum distance between two finite planar sets
References (25)
- et al.
Divide and conquer for linear expected time
Inform. Process. Lett.
(1978) - et al.
A linear algorithm for finding the convex hull of a simple polygon
Inform. Process. Lett.
(December 1979) A note on finding convex hulls via maximal vectors
Inform. Process. Lett.
(August 1980)An efficient algorithm for determining the convex hull of a planar set
Inform. Process. Lett.
(1972)- et al.
Pattern Classification and Scence Analysis
Hierarchical clustering schemes
Psychometrika
(September 1967)Geometric complexity
Computational geometry
- et al.
On Geometric Algorithms that Use the Furthest-Point Voronoi Diagram
School of Computer Science, McGill University, Tech. Rept. No. 81.3
(January 1981) Pattern recognition and geometrical complexity
Uber die konvexe Hülle von n zufällig gewählten Punkten, I
Z. Wahrsch. Verw. Gebiete
(1963)
Uber die konvexe Hülle von n zufällig gewählten Punkten, II
Z. Wahrsch. Verw. Gebiete
(1964)
Cited by (24)
Group decision making in manufacturing systems: An approach using spatial preference information and indifference zone
2020, Journal of Manufacturing Systemsα-Kernel problem with fuzzy visibility
1995, Fuzzy Sets and SystemsConvexity problems on meshes with multiple broadcasting
1995, Journal of Parallel and Distributed ComputingEditorial
1993, Pattern Recognition LettersMaximum distance between two sets of points in E<sup>d</sup>
1993, Pattern Recognition LettersComputing the extreme distances between two convex polygons
1985, Journal of Algorithms
Copyright © 1983 Published by Elsevier Inc.