A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets (Q3953212)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets |
scientific article |
Statements
A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets (English)
0 references
1982
0 references
convex hull
0 references
diameter
0 references
cluster analysis
0 references
geometric complexity
0 references
pattern recognition
0 references
