Pages that link to "Item:Q1283771"
From MaRDI portal
The following pages link to Geometric pattern matching in \(d\)-dimensional space (Q1283771):
Displaying 16 items.
- Pattern matching in doubling spaces (Q832835) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Approximate decision algorithms for point set congruence (Q1328753) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- Geometric pattern matching reduces to \(k\)-SUM (Q2172655) (← links)
- Computing Klee's measure of grounded boxes (Q2346960) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems (Q2408088) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Geometric Pattern Matching Reduces to k-SUM. (Q6065434) (← links)
- Geometry of the matching distance for 2D filtering functions (Q6082669) (← links)
- Geometric pattern matching in d-dimensional space (Q6102306) (← links)
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points (Q6182460) (← links)
