Improvements on geometric pattern matching problems

DOI10.1007/3-540-55706-7_28zbMATH Open1502.68306OpenAlexW1591972986MaRDI QIDQ5056151FDOQ5056151

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The upper envelope of Voronoi surfaces and its applications
• Congruence, similarity, and symmetries of geometric objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Approximate decision algorithms for point set congruence
• Title not available (Why is that?)

Cited In (16)

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

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)