Getting around a lower bound for the minimum Hausdorff distance

DOI10.1016/S0925-7721(97)00032-1zbMath0901.68201OpenAlexW2001909273MaRDI QIDQ1392850

Klara Kedem, L. Paul Chew

Publication date: 26 November 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00032-1

zbMATH Keywords

geometric pattern matching problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space ⋮ Geometric pattern matching for point sets in the plane under similarity transformations ⋮ On some geometric selection and optimization problems via sorted matrices

Cites Work

• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The upper envelope of Voronoi surfaces and its applications
• Geometric pattern matching in \(d\)-dimensional space
• New Upper Bounds in Klee’s Measure Problem
• Applications of Parametric Searching in Geometric Optimization
• Finding kth paths and p-centers by generating and searching good data structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Getting around a lower bound for the minimum Hausdorff distance