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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 175-183

  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

Congruence; Fixed Parameter Tractability; Geometric Point Set Matching; Unbounded Dimension

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PATTERN RECOGNITION; PROBLEM SOLVING;

FIXED PARAMETER TRACTABILITY; GEOMETRIC POINT SET MATCHING; SUBSET CONGRUENCE; UNBOUNDED DIMENSION;

SET THEORY;

EID: 33750228443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_16     Document Type: Conference Paper

References (20)

1. T. Akutsu. On determining the congruence of point sets in d-dimensions. Comput. Geom. Theory Appl., 9(4):247-256, 1998.
2. H. Alt and L.J. Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. In J.R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 121-153. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1999.
3. H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl. Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom., 3:237-256, 1988.
4. P. Braß. Exact point pattern matching and the number of congruent triangles in a three-dimensional point set. In Proc. of the 8th Annu. European Sympos. Algorithms (ESA), volume 1879 of LNCS, pages 112-119, 2000.
5. P. Braß and C. Knauer. Testing the congruence of d-dimensional point sets. Int. J. of Comp. Geom. Appl., 12(1):115-124, 2002.
6. P. Braß and J. Pach. Problems and results on geometric patterns. In D. Avis, A. Hertz, and O. Marcotte, editors, Graph Theory and Combinatorial Optimization, Gerad 25th Anniversary, pages 17-36. Springer, 2005.
7. S. Cabello, P. Giannopoulos, C. Knauer, and G. Rote. Matching point sets with respect to the Earth Mover's Distance. In Proc. of the 13th Annu. European Sympos. Algorithms (ESA), volume 3669 of LNCS, pages 520-531, 2005.
8. Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David Juedes, Iyad A. Kanj, and Ge Xia. Tight lower bounds for certain parameterized NP-hard problems. Information and Computation, 201(2):216-231, 2005.
9. L.P. Chew, D. Dor, A. Efrat, and K. Kedem. Geometric pattern matching in d-dimensional space. Discrete Comput. Geom., 21, 1999.
10. L.P. Chew, M. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. Comput. Geom. Theory Appl., 7:113-124, 1997.
11. S.D. Cohen and L.J. Guibas. The Earth Mover's Distance under transformation sets. In Proceedings of the 7th IEEE International Conference on Computer Vision, pages 173-187, September 1999.
12. P.J. de Rezende and D.T. Lee. Point set matching in d-dimensions. Algorithmica, 13:387-404, 1995.
13. A. Efrat, A. Itai, and M.J. Katz. Geometry helps in bottleneck matching and related problems. Algorithmica, 31:1-28, 2001.
14. J. Flum and M. Grohe. Parameterized Complexity Theory, volume XIV of Series: Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, 2006.
15. M. Hagedoorn and R.C. Veltkamp. State-of-the-art in shape matching. Technical Report UU-CS-1999-027, Institute of Information and Computing Sciences, Utrecht University, The Netherlands, 1999.
16. D.P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267-291, 1993.
17. D. Marx. Efficient approximation schemes for geometric problems? In Proc. of the 13th Annu. European Sympos. Algorithms (ESA), volume 3669 of LNCS, pages 448-459, 2005.
18. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. ACM, 31:114-127, 1984.
19. N. Megiddo. On the complexity of some geometric problems in unbounded dimension. J. Symb. Comput., 10(3-4):327-334, 1990.
20. C. Papadimitriou and S. Safra. The complexity of low-distortion embeddings between point sets. In Proc. of the 16th Annu. ACM-SIAM Sympos. Discrete Algorithms (SODA), pages 112-118. SIAM, 2005.