On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching

DOI10.1007/11847250_16zbMath1154.68422OpenAlexW1491682057MaRDI QIDQ3499735

Sergio Cabello, Panos Giannopoulos, Christian Knauer

Publication date: 3 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11847250_16

zbMATH Keywords

CongruenceFixed Parameter TractabilityGeometric Point Set MatchingUnbounded Dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Elastic Geometric Shape Matching for Point Sets under Translations ⋮ Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Small candidate set for translational pattern search ⋮ Fixed-parameter complexity and approximability of norm maximization

This page was built for publication: On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching