Point set pattern matching in \(d\)-dimensions
From MaRDI portal
Publication:1891233
DOI10.1007/BF01293487zbMath0827.68114MaRDI QIDQ1891233
Publication date: 30 May 1995
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01293487
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
One-dimensional approximate point set pattern matching with \(L_p\)-norm, On determining the congruence of point sets in \(d\) dimensions, Point set pattern matching in \(d\)-dimensions, On the parameterized complexity of \(d\)-dimensional point set pattern matching, Improved approximation bounds for planar point pattern matching, Simple algorithms for partial point set pattern matching under rigid motion
Cites Work
- Unnamed Item
- Unnamed Item
- The power of geometric duality revisited
- The power of geometric duality
- Congruence, similarity, and symmetries of geometric objects
- Point set pattern matching in \(d\)-dimensions
- Multidimensional Sorting
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Zone Theorem for Hyperplane Arrangements
- An optimal algorithm for geometrical congruence