Generalized approximate algorithms for point set congruence
From MaRDI portal
Recommendations
- Approximate decision algorithms for point set congruence
- Computing largest common point sets under approximate congruence
- Approximation algorithms for aligning points
- Approximation algorithms for aligning points
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Computing and Combinatorics
- Combinatorial Pattern Matching
- A parallel algorithm for the conductor of a point set
- On determining the congruence of point sets in \(d\) dimensions
- On determining the congruity of point sets in higher dimensions
Cites work
- Approximate decision algorithms for approximate congruence
- Congruence, similarity, and symmetries of geometric objects
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 3760882 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
Cited in
(10)- The translation square map and approximate congruence
- Approximate decision algorithms for approximate congruence
- Approximate decision algorithms for point set congruence
- Approximate congruence in nearly linear time
- Computing largest common point sets under approximate congruence
- Congruence testing of point sets in three and four dimensions. Results and techniques
- Computing and Combinatorics
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Linear time algorithms for testing approximate congruence in the plane
- Computing fair and bottleneck matchings in geometric graphs
This page was built for publication: Generalized approximate algorithms for point set congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060129)
