Approximate congruence in nearly linear time
From MaRDI portal
Publication:1869745
Recommendations
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1305437 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 1424291 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Approximate decision algorithms for point set congruence
- Average-case analysis of algorithms for matchings and related problems
- Congruence, similarity, and symmetries of geometric objects
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
- Metric entropy of some classes of sets with differentiable boundaries
- On Representatives of Subsets
Cited in
(13)- Finding Largest Common Point Sets
- Noisy colored point set matching
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Efficient algorithms for shape and pattern matching.
- scientific article; zbMATH DE number 1445323 (Why is no real title available?)
- Congruence, similarity, and symmetries of geometric objects
- Geometry helps in bottleneck matching and related problems
- Bipartite diameter and other measures under translation
- Approximate decision algorithms for point set congruence
- Fast Software Encryption
- Approximate one-to-one point pattern matching
- Linear Approximations of Addition Modulo 2n-1
- scientific article; zbMATH DE number 7559117 (Why is no real title available?)
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)