Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms

DOI10.1287/IJOC.4.4.375zbMATH Open0759.68029OpenAlexW2078838257MaRDI QIDQ4024310FDOQ4024310

Authors: Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman 

Publication date: 25 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6357a9f5d8518dc456d2ce3e134866056c086e81

Recommendations

• scientific article; zbMATH DE number 1305437
• Geometry helps in bottleneck matching and related problems
• On matching point configurations
• Approximate one-to-one point pattern matching
• Probabilistic matching of planar regions

zbMATH Keywords

point pattern matching

Mathematics Subject Classification ID

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

Cited In (10)

• An algorithm for matching point sets using the \(l_1\) norm
• Geometric pattern matching for point sets in the plane under similarity transformations
• On matching point configurations
• Geometric pattern matching under Euclidean motion
• Matching sets of line segments
• Approximate decision algorithms for point set congruence
• Generalized approximate algorithms for point set congruence
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
• Simple algorithms for partial point set pattern matching under rigid motion
• Approximate congruence in nearly linear time

This page was built for publication: Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms

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