On the parameterized complexity of d-dimensional point set pattern matching

DOI10.1016/J.IPL.2007.08.003MaRDI QIDQ2380044zbMATH OpenOpenAlexFDO

Authors S. Cabello, Panos Giannopoulos, Christian Knauer

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.08.003

zbMATH Keywords

computational complexitycomputational geometrycongruencefixed parameter tractabilityunbounded dimensiongeometric point set matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching
• Point set pattern matching in \(d\)-dimensions
• scientific article; zbMATH DE number 1670651
• The parameterized complexity of geometric graph isomorphism
• The parameterized complexity of geometric graph isomorphism

Cites work

• scientific article; zbMATH DE number 1670651 (Why is no real title available?)
• scientific article; zbMATH DE number 1424291 (Why is no real title available?)
• scientific article; zbMATH DE number 2246588 (Why is no real title available?)
• Algorithms – ESA 2005
• Algorithms – ESA 2005
• Congruence, similarity, and symmetries of geometric objects
• Geometric pattern matching in d-dimensional space
• Geometric pattern matching under Euclidean motion
• Geometry helps in bottleneck matching and related problems
• On determining the congruence of point sets in \(d\) dimensions
• On the complexity of some geometric problems in unbounded dimension
• Parametrized complexity theory.
• Point set pattern matching in \(d\)-dimensions
• TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS
• The complexity of low-distortion embeddings between point sets
• The traveling salesman problem with few inner points
• The upper envelope of Voronoi surfaces and its applications
• Tight lower bounds for certain parameterized NP-hard problems

Cited in

(9)

• The parameterized complexity of finding point sets with hereditary properties
• A (slightly) faster algorithm for Klee's measure problem
• Point set pattern matching in \(d\)-dimensions
• The parameterized complexity of geometric graph isomorphism
• Approximate one-to-one point pattern matching
• 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
• The parameterized complexity of geometric graph isomorphism
• Approximate nearest neighbor search under translation invariant Hausdorff distance

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 Q2380044)