A linear time algorithm for the computation of some distance functions between convex polygons

DOI10.1051/ro/1991250404131zbMath0770.68109OpenAlexW2523129656MaRDI QIDQ3991698

Sérgio Lifschitz, Celso Carneiro Ribeiro, Mikhail J. Atallah

Publication date: 28 June 1992

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105023

zbMATH Keywords

algorithmsconvex polygonscomputational geometrydistance computationrobot visioncontour fitting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Unnamed Item ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering ⋮ Approximation of convex sets by polytopes

This page was built for publication: A linear time algorithm for the computation of some distance functions between convex polygons