Optimal algorithms for computing the minimum distance between two finite planar sets

DOI10.1016/0167-8655(83)90041-7zbMath0529.68059OpenAlexW2068252235MaRDI QIDQ3311702

Binay K. Bhattacharya, Godfried T. Toussaint

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0167-8655(83)90041-7

zbMATH Keywords

pattern recognitionconvex polygonscluster analysiscomputational geometryminimum distance

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (1)

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

This page was built for publication: Optimal algorithms for computing the minimum distance between two finite planar sets