Approximate congruence in nearly linear time
From MaRDI portal
Publication:1869745
DOI10.1016/S0925-7721(02)00095-0zbMATH Open1018.65025MaRDI QIDQ1869745FDOQ1869745
Piotr Indyk, Suresh Venkatasubramanian
Publication date: 28 April 2003
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Hausdorff distancecomputational geometrymetric entropypattern matchinggeometric objectscombinatorial pattern matchingbottleneck distancegeometric matching
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Representatives of Subsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Congruence, similarity, and symmetries of geometric objects
- Average-case analysis of algorithms for matchings and related problems
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Title not available (Why is that?)
- Approximate decision algorithms for point set congruence
- Metric entropy of some classes of sets with differentiable boundaries
- Title not available (Why is that?)
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
Cited In (11)
- Geometry helps in bottleneck matching and related problems
- Title not available (Why is that?)
- Fast Software Encryption
- Congruence, similarity, and symmetries of geometric objects
- Approximate decision algorithms for point set congruence
- Noisy colored point set matching
- Finding Largest Common Point Sets
- Bipartite diameter and other measures under translation
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Title not available (Why is that?)
- Linear Approximations of Addition Modulo 2n-1
This page was built for publication: Approximate congruence in nearly linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869745)
