Geometric pattern matching under Euclidean motion

DOI10.1016/0925-7721(95)00047-XzbMATH Open0869.68110OpenAlexW2064597564MaRDI QIDQ676592FDOQ676592

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

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

zbMATH Keywords

minimum Hausdorff distancemodel-based computer vision

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Triangulating a simple polygon in linear time
• The upper envelope of Voronoi surfaces and its applications
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Congruence, similarity, and symmetries of geometric objects
• Slowing down sorting networks to obtain faster sorting algorithms
• Parallel Merge Sort
• An Optimal-Time Algorithm for Slope Selection
• Triangulating a simple polygon
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (25)

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

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)