Improvements on geometric pattern matching problems

DOI10.1007/3-540-55706-7_28MaRDI QIDQ5056151zbMATHOpenAlexFDO

Authors L. Paul Chew, Klara Kedem

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55706-7_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Getting around a lower bound for the minimum Hausdorff distance
• Geometric pattern matching in d-dimensional space
• Geometric pattern matching in \(d\)-dimensional space
• Hausdorff distance under translation for points and balls
• Geometric pattern matching under Euclidean motion

Cites work

• scientific article; zbMATH DE number 432817 (Why is no real title available?)
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 742950 (Why is no real title available?)
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Finding kth paths and p-centers by generating and searching good data structures
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• The upper envelope of Voronoi surfaces and its applications

Cited in

(18)

• Minimum \(L_\infty\) Hausdorff distance of point sets under translation: g eneralizing Klee's measure problem
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
• Bottleneck partial-matching Voronoi diagrams and applications
• Geometry helps to compare persistence diagrams
• Computing the smallest \(k\)-enclosing circle and related problems
• Hausdorff matching and Lipschitz optimization
• Geometric pattern matching under Euclidean motion
• Geometric pattern matching reduces to \(k\)-SUM
• One-way and round-trip center location problems
• Computing the smallest k-enclosing circle and related problems
• A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
• The upper envelope of Voronoi surfaces and its applications
• On some geometric selection and optimization problems via sorted matrices
• Computing fair and bottleneck matchings in geometric graphs
• Geometric Pattern Matching Reduces to k-SUM.
• Approximate one-to-one point pattern matching
• Geometric pattern matching in d-dimensional space
• Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation

This page was built for publication: Improvements on geometric pattern matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056151)