A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets

DOI10.1016/0167-8655(82)90046-0zbMath0491.68090OpenAlexW1981568663MaRDI QIDQ3953212

Godfried T. Toussaint, Jim A. McAlear

Publication date: 1982

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(82)90046-0

zbMATH Keywords

pattern recognitiondiameterconvex hullcluster analysisgeometric complexity

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

On the longest spanning tree with neighborhoods ⋮ Minimum vertex distance between separable convex polygons

This page was built for publication: A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets