Geometric pattern matching under Euclidean motion

DOI10.1016/0925-7721(95)00047-XzbMath0869.68110OpenAlexW2064597564MaRDI QIDQ676592

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating a simple polygon in linear time
• The upper envelope of Voronoi surfaces and its applications
• Triangulating a simple polygon
• Congruence, similarity, and symmetries of geometric objects
• Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parallel Merge Sort
• An Optimal-Time Algorithm for Slope Selection
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• Slowing down sorting networks to obtain faster sorting algorithms
• Improvements on geometric pattern matching problems