Geometric pattern matching in d-dimensional space
From MaRDI portal
Geometric pattern matching in \(d\)-dimensional space
Recommendations
Cited in
(22)- A (slightly) faster algorithm for Klee's measure problem
- Approximate decision algorithms for point set congruence
- Getting around a lower bound for the minimum Hausdorff distance
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Point set pattern matching in \(d\)-dimensions
- Geometric pattern matching reduces to \(k\)-SUM
- Computing Klee's measure of grounded boxes
- On the parameterized complexity of \(d\)-dimensional point set pattern matching
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- One-way and round-trip center location problems
- Improvements on geometric pattern matching problems
- Geometric Pattern Matching Reduces to k-SUM.
- Geometry of the matching distance for 2D filtering functions
- Geometric pattern matching in d-dimensional space
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
- Minimum \(L_\infty\) Hausdorff distance of point sets under translation: g eneralizing Klee's measure problem
- Complete and continuous invariants of 1-periodic sequences in polynomial time
- Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
- An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D
- Pointwise distance distributions for detecting near-duplicates in large materials databases
- Complete invariants of atomic clouds under rigid motion with Lipschitz continuous metrics in a polynomial time
- Pattern matching in doubling spaces
This page was built for publication: Geometric pattern matching in \(d\)-dimensional space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283771)
