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

Information Processing Letters

Volumn 105, Issue 2, 2008, Pages 73-77

  Cabello, Sergio ^a   Giannopoulos, Panos ^b   Knauer, Christian ^c  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

^b HUMBOLDT UNIVERSITY   (Germany)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Computational complexity; Computational geometry; Congruence; Fixed parameter tractability; Geometric point set matching; Unbounded dimension

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING;

FIXED PARAMETER TRACTABILITY; GEOMETRIC POINT SET MATCHING; HAUSDORFF DISTANCE;

PATTERN MATCHING;

EID: 35448954441     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.08.003     Document Type: Article

References (19)

1. Akutsu T. On determining the congruence of point sets in d-dimensions. Comput. Geom. Theory Appl. 9 4 (1998) 247-256
2. Alt H., and Guibas L.J. Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack J.R., and Urrutia J. (Eds). Handbook of Computational Geometry (1999), Elsevier Science Publishers B.V., North-Holland, Amsterdam 121-153
3. Alt H., Mehlhorn K., Wagener H., and Welzl E. Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3 (1988) 237-256
4. Braß P. Exact point pattern matching and the number of congruent triangles in a three-dimensional point set. Proc. 8th Ann. European Sympos. Algorithms. Lecture Notes in Computer Science vol. 1879 (2000), Springer-Verlag 112-119
5. Braß P., and Knauer C. Testing the congruence of d-dimensional point sets. Internat. J. Comput. Geom. Appl. 12 1 (2002) 115-124
6. Braß P., and Pach J. Problems and results on geometric patterns. In: Avis D., Hertz A., and Marcotte O. (Eds). Graph Theory and Combinatorial Optimization, Gerad 25th Anniversary (2005), Springer-Verlag 17-36
7. Cabello S., Giannopoulos P., Knauer C., and Rote G. Matching point sets with respect to the Earth Mover's Distance. Proc. 13th Ann. European Sympos. Algorithms. Lecture Notes in Computer Science vol. 3669 (2005), Springer-Verlag 520-531
8. Chen J., Chor B., Fellows M., Huang X., Juedes D., Kanj I.A., and Xia G. Tight lower bounds for certain parameterized NP-hard problems. Inform. and Comput. 201 2 (2005) 216-231
9. Chew L.P., Dor D., Efrat A., and Kedem K. Geometric pattern matching in d-dimensional space. Discrete Comput. Geom. 21 (1999)
10. Chew L.P., Goodrich M., Huttenlocher D.P., Kedem K., Kleinberg J.M., and Kravets D. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl. 7 (1997) 113-124
11. S.D. Cohen, L.J. Guibas, The Earth Mover's Distance under transformation sets, in: Proc. 7th IEEE Internat. Conf. Computer Vision, 1999, pp. 173-187
12. de Rezende P.J., and Lee D.T. Point set matching in d-dimensions. Algorithmica 13 (1995) 387-404
13. Deineko V.G., Hoffmann M., Okamoto Y., and Woeginger G.J. The traveling salesman problem with few inner points. Oper. Res. Lett. 34 (2006) 106-110
14. Efrat A., Itai A., and Katz M.J. Geometry helps in bottleneck matching and related problems. Algorithmica 31 (2001) 1-28
15. Flum J., and Grohe M. Parameterized Complexity Theory. Texts in Theoretical Computer Science, An EATCS Series vol. XIV (2006), Springer-Verlag
16. Huttenlocher D.P., Kedem K., and Sharir M. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom. 9 (1993) 267-291
17. Marx D. Efficient approximation schemes for geometric problems?. Proc. 13th Ann. European Sympos. Algorithms. Lecture Notes in Computer Science vol. 3669 (2005), Springer-Verlag 448-459
18. Megiddo N. On the complexity of some geometric problems in unbounded dimension. J. Symb. Comput. 10 3-4 (1990) 327-334
19. C. Papadimitriou, S. Safra, The complexity of low-distortion embeddings between point sets, in: Proc. 16th Ann. ACM-SIAM Sympos. Discrete Algorithms, 2005, pp. 112-118