Geometric pattern matching in \(d\)-dimensional space
From MaRDI portal
Publication:1283771
DOI10.1007/PL00009420zbMath0924.68191OpenAlexW2079176421MaRDI QIDQ1283771
Publication date: 30 March 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009420
Related Items (9)
Approximate decision algorithms for point set congruence ⋮ 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 ⋮ Getting around a lower bound for the minimum Hausdorff distance ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering ⋮ A (slightly) faster algorithm for Klee's measure problem ⋮ One-way and round-trip center location problems ⋮ Computing Klee's measure of grounded boxes
This page was built for publication: Geometric pattern matching in \(d\)-dimensional space
