Finding Largest Common Point Sets
From MaRDI portal
Publication:3132918
Recommendations
- scientific article; zbMATH DE number 1670646
- scientific article; zbMATH DE number 738979
- 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
- scientific article; zbMATH DE number 1555958
- Matching points with disks with a common intersection
- Finding convex sets among points in the plane
- Point set pattern matching in \(d\)-dimensions
Cites work
- scientific article; zbMATH DE number 1670646 (Why is no real title available?)
- scientific article; zbMATH DE number 1003290 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An application of point pattern matching in astronautics
- Approximate congruence in nearly linear time
- Approximate decision algorithms for point set congruence
- Approximate one-to-one point pattern matching
- Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules
- Bottleneck non-crossing matching in the plane
- Bottleneck partial-matching Voronoi diagrams and applications
- Combinatorial and experimental methods for approximate point pattern matching
- Congruence, similarity, and symmetries of geometric objects
- Geometry helps in bottleneck matching and related problems
- Noisy colored point set matching
Cited in
(3)
This page was built for publication: Finding Largest Common Point Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132918)
