Approximate congruence in nearly linear time

DOI10.1016/S0925-7721(02)00095-0zbMath1018.65025MaRDI QIDQ1869745

Piotr Indyk, Suresh Venkatasubramanian

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric objectscomputational geometrypattern matchingmetric entropyHausdorff distancecombinatorial pattern matchingbottleneck distancegeometric matching

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Bipartite diameter and other measures under translation ⋮ Noisy colored point set matching ⋮ Unnamed Item ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES ⋮ Finding Largest Common Point Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Metric entropy of some classes of sets with differentiable boundaries
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• Average-case analysis of algorithms for matchings and related problems
• On Representatives of Subsets

This page was built for publication: Approximate congruence in nearly linear time