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

Authors:
Sergio Cabello;Panos Giannopoulos;Christian Knauer
Affiliations:
Department of Mathematics, IMFM and FMF, University of Ljubljana, Jadranska 19, SI-1000 Ljubljana, Slovenia;Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, D-10099 Berlin, Germany;Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany
Venue:
Information Processing Letters
Year:
2008

Citing 12
Cited 3

Congruence, similarity and symmetries of geometric objects

Discrete & Computational Geometry - ACM Symposium on Computational Geometry, Waterloo
On the complexity of some geometric problems in unbounded dimension

Journal of Symbolic Computation
Geometric pattern matching under Euclidean motion

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
On determining the congruence of point sets in d dimensions

Computational Geometry: Theory and Applications
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
The Earth Mover's Distance under Transformation Sets

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
The complexity of low-distortion embeddings between point sets

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tight lower bounds for certain parameterized NP-hard problems

Information and Computation
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Efficient approximation schemes for geometric problems?

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Matching point sets with respect to the earth mover’s distance

ESA'05 Proceedings of the 13th annual European conference on Algorithms
The traveling salesman problem with few inner points

Operations Research Letters

A (slightly) faster algorithm for Klee's measure problem

Computational Geometry: Theory and Applications
A simple algorithm for approximate partial point set pattern matching under rigid motion

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Approximate one-to-one point pattern matching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.90

Visualization

Abstract

In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(nlogn) algorithm for the following proximity problem: Given a set P of n (2) points in the plane, ...