Geometric pattern matching under Euclidean motion

DOI10.1016/0925-7721(95)00047-XMaRDI QIDQ676592zbMATH OpenOpenAlexFDO

Authors L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Dina Kravets, Jon M. Kleinberg

Publication date 18 March 1997

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(95)00047-x

zbMATH Keywords

minimum Hausdorff distancemodel-based computer vision

Mathematics Subject Classification ID

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

Recommendations

• Improvements on geometric pattern matching problems
• scientific article; zbMATH DE number 1305437
• Geometric pattern matching for point sets in the plane under similarity transformations
• Getting around a lower bound for the minimum Hausdorff distance

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 4051003 (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?)
• An Optimal-Time Algorithm for Slope Selection
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Congruence, similarity, and symmetries of geometric objects
• Improvements on geometric pattern matching problems
• Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• Parallel Merge Sort
• Slowing down sorting networks to obtain faster sorting algorithms
• The upper envelope of Voronoi surfaces and its applications
• Triangulating a simple polygon
• Triangulating a simple polygon in linear time

Cited in

(25)

• Biomolecular topology: modelling and analysis
• Noisy colored point set matching
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
• A near-linear algorithm for the planar segment-center problem
• Simple algorithms for partial point set pattern matching under rigid motion
• Pattern matching in doubling spaces
• Matching sets of line segments
• Improved approximation bounds for planar point pattern matching
• scientific article; zbMATH DE number 2079740 (Why is no real title available?)
• Geometric pattern matching for point sets in the plane under similarity transformations
• Geometric pattern matching reduces to \(k\)-SUM
• Improvements on geometric pattern matching problems
• Discrete and geometric branch and bound algorithms for~medical image registration
• Convex hull analysis of evolutionary and phylogenetic relationships between biological groups
• Parametric search made practical
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• Approximate input sensitive algorithms for point pattern matching
• Ant colony optimization based binary search for efficient point pattern matching in images
• Geometric Pattern Matching Reduces to k-SUM.
• AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS
• Maximizing the area of overlap of two unions of disks under rigid motion
• Approximate one-to-one point pattern matching
• Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
• Efficient computation of the Hausdorff distance between polytopes by exterior random covering
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems

This page was built for publication: Geometric pattern matching under Euclidean motion

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