Computing Largest Common Point Sets under Approximate Congruence

The problem of computing a largest common point set (LCP) between two point sets under Ɛ-congruence with the bottleneck matching metric has recently been a subject of extensive study. Although polynomial time solutions are known for the planar case and for restricted sets of transformations and metrics (like translations and the Hausdorff-metric under L∞-norm), no complexity results are formally known for the general problem. In this paper we give polynomial time algorithms for this problem under different classes of transformations and metrics for any fixed dimension, and establish NP-hardness for unbounded dimensions. Any solution to this (or related) problem, especially in higher dimensions, is generally believed to involve implementation difficulties because they rely on the computation of intersections between algebraic surfaces. We show that (contrary to intuitive expectations) this problem can be solved under a rational arithmetic model in a straightforward manner if the set of transformations is extended to general affine transformations under the L∞-norm (difficulty of this problem is generally expected to be in the order: translations < rotation < isometry < more general). To the best of our knowledge this is also the first paper which deals with the LCP-problem under such a general class of transformations.

[1]  Piotr Indyk,et al.  Geometric matching under noise: combinatorial bounds and algorithms , 1999, SODA '99.

[2]  David E. Cardoze,et al.  Pattern matching for spatial point sets , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[3]  Alon Itai,et al.  Geometry Helps in Bottleneck Matching and Related Problems , 2001, Algorithmica.

[4]  Paul J. Heffernan,et al.  Generalized Approzimate Algorithms for Point Set Congruence , 1993, WADS.

[5]  Paul J. Heffernan.  The Translation Square Map and Approximate Congruence , 1991, Inf. Process. Lett..

[6]  Kurt Mehlhorn,et al.  Congruence, similarity, and symmetries of geometric objects , 1987, SCG '87.

[7]  Tatsuya Akutsu.  On determining the congruence of point sets in d dimensions , 1998, Comput. Geom..

[8]  Nora Sleumer,et al.  Output-Sensitive Cell Enumeration in Hyperplane Arrangements , 1998, Nord. J. Comput..

[9]  Piotr Indyk,et al.  Approximate congruence in nearly linear time , 2000, SODA '00.

[10]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..

[11]  Stefan Schirra,et al.  Approximate decision algorithms for point set congruence , 1992, SCG '92.

[12]  Stefan Schirra.  Approximate Decision Algorithms for Approximate Congruence , 1992, Inf. Process. Lett..

[13]  Tatsuya Akutsu,et al.  Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets , 1998, Discret. Comput. Geom..

[14]  Marie-Françoise Roy,et al.  On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety , 1995, J. Complex..

[15]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[16]  Alon Efrat,et al.  Geometric Pattern Matching in d -Dimensional Space , 1995, ESA.

[17]  Michael T. Goodrich,et al.  Geometric Pattern Matching Under Euclidean Motion , 1993, Comput. Geom..

[18]  S. Basu,et al.  A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials , 1998 .

[19]  Tatsuya Akutsu,et al.  On the approximation of largest common subtrees and largest common point sets , 2000, Theor. Comput. Sci..

[20]  Leonidas J. Guibas,et al.  Discrete Geometric Shapes: Matching, Interpolation, and Approximation , 2000, Handbook of Computational Geometry.

[21]  Samarjit Chakraborty,et al.  Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules , 1999, WADS.

[22]  Sandy Irani,et al.  Combinatorial and experimental results for randomized point matching algorithms , 1996, SCG '96.