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

DOI10.1007/11847250_16MaRDI QIDQ3499735zbMATH OpenOpenAlexFDO

Authors S. 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• Point set pattern matching in \(d\)-dimensions
• scientific article; zbMATH DE number 1305437
• The parameterized complexity of geometric graph isomorphism
• The parameterized complexity of geometric graph isomorphism

Cited in

(8)

• The parameterized complexity of finding point sets with hereditary properties
• Fixed-parameter complexity and approximability of norm maximization
• Elastic geometric shape matching for point sets under translations
• The parameterized complexity of geometric graph isomorphism
• Fixed-parameter tractability and lower bounds for stabbing problems
• The parameterized complexity of geometric graph isomorphism
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• Small candidate set for translational pattern search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3499735)