Computing largest common point sets under approximate congruence
From MaRDI portal
Recommendations
- Generalized approximate algorithms for point set congruence
- Finding Largest Common Point Sets
- Approximate decision algorithms for point set congruence
- Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- On the approximation of largest common subtrees and largest common point sets
- On the approximation of largest common subtrees and largest common point sets
- Approximating largest convex hulls for imprecise points
- Approximating Largest Convex Hulls for Imprecise Points
- scientific article; zbMATH DE number 738979
Cited in
(10)- Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
- Congruence, similarity, and symmetries of geometric objects
- Constant time approximation scheme for largest well predicted subset
- Finding Largest Common Point Sets
- Finding Largest Well-Predicted Subset of Protein Structure Models
- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
- Generalized approximate algorithms for point set congruence
- Applications of dimensionality reduction and exponential sums to graph automorphism
- On protein structure alignment under distance constraint
- Approximately matching polygonal curves with respect to the Fréchet distance
This page was built for publication: Computing largest common point sets under approximate congruence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753922)
