Efficient colored point set matching under noise

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

Volumn 4705 LNCS, Issue PART 1, 2007, Pages 26-40

  Diez, Yago ^a   Sellarès, J Antoni ^a  

^a UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; QUERY PROCESSING; TREES (MATHEMATICS);

BOTTLENECK DISTANCE; NEIGHBORHOOD QUERIES;

SET THEORY;

EID: 38049032913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74472-6_3     Document Type: Conference Paper

References (11)

1. Akutsu, T., Kanaya, K., Ohyarna, A., Fujiyama, A.: Point Matching Under Non-Uniform Distortions. Discrete Applied Mathematics, special issue: computational biology series IV, 5-21 (2003)
2. Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity and symmetries of geometric objects. Discrete & Computational Geometry 3, 237-256 (1988)
3. Choi, V., Goyal, N.: A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 285-296. Springer, Heidelberg (2004)
4. Efrat, A., Itai, A., Katz, M.J.: Geometry helps in Bottleneck Matching and related problems. Algorithmica 31, 1 28 (2001)
5. Eppstein, D., Goodrich, M.T., Sun, J.Z.: The skip quadtree: a simple dynamic data structure for multidimensional data. In: 21st ACM Symp. on Comp. Geom., pp. 296-305. ACM Press, New York (2005)
6. Finn, P., Kavraki, L.E., Latombe, J.C., Motwani, R., Shelton, C., Venkatasubramanian, S., Yao, A.: Rapid: Randomized pharmacophore identification for drug design. In: Proc. 13th ACM Symp. Comp. Geom., pp. 324-333. ACM Press, New York (1997)
7. Heffernan, P.J., Schirra, S.: Approximate decision algorithms for point set congruence. Computational Geometry: Theory and Applications 4(3), 137-156 (1994)
8. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225-231 (1973)
9. Hunt, K.H.: Kinematic Geometry of Mechanisms, ch. 4,7. Oxford University Press, Oxford (1978)
10. Indyk, P., Venkatasubramanian, S.: Approximate congruence in nearly linear time. Comput. Geom. 24(2), 115-128 (2003)
11. Weber, G., Knipping, L., Alt, H.: An Application of Point Pattern Matching in Astronautics. J. Symbolic Computation 11, 1-20 (1994)