Combinatorial and experimental methods for approximate point pattern matching
From MaRDI portal
Recommendations
Cited in
(15)- Maximizing the area of overlap of two unions of disks under rigid motion
- Hausdorff matching and Lipschitz optimization
- scientific article; zbMATH DE number 6263177 (Why is no real title available?)
- Output sensitive algorithms for approximate incidences and their applications
- Geometric pattern matching reduces to \(k\)-SUM
- Output sensitive algorithms for approximate incidences and their applications
- Genetic algorithm for affine point pattern matching
- Geometric Pattern Matching Reduces to k-SUM.
- Geometric pattern matching for point sets in the plane under similarity transformations
- Approximate input sensitive algorithms for point pattern matching
- Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
- Recurrence analysis on Julia sets of semigroups of complex polynomials
- Finding Largest Common Point Sets
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- Small candidate set for translational pattern search
This page was built for publication: Combinatorial and experimental methods for approximate point pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889585)