Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets

Discrete and Computational Geometry

Volumn 20, Issue 3, 1998, Pages 307-331

  Akutsu, T ^a   Tamaki, H ^b   Tokuyama, T ^c  

^a UNIVERSITY OF TOKYO   (Japan)

^b MEIJI UNIVERSITY   (Japan)

^c IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032348702     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009388     Document Type: Article

References (31)

1. P. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting Distances in the Plane, Algorithmica, vol. 9, pp. 495-514, 1993.
2. T. Akutsu, Substructure Search and Alignment Algorithms for Three-Dimensional Protein Structures, Proc. SIGAL-41, pp. 1-8, IPSJ, 1994.
3. T. Akutsu, On Determining the Congruency of Point Sets in Higher Dimensions, Proc. ISAAC '94 (LNCS, vol. 834), pp. 38-55, Springer-Verlan, Berlin, 1994.
4. H. Alt, K. Melhorn, H. Wagener, and E. Welzl. Congruence, Similarity, and Symmetries of Geometric Objects, Discrete Comput. Geom., vol. 3, pp. 237-256, 1988.
5. M. Atkinson, An Optimal Algorithm for Geometric Congruence, J. Algorithms, vol. 8, pp. 159-172, 1987.
6. D. H. Ballard, Generalizing the Hough Transformation to Detect Arbitrary Shapes, Pattern Recognition, vol. 13, no. 2, pp. 111-122, 1981.
7. B. Bollobás, Extremal Graph Theory, Academic Press, New York. 1978.
8. P. Chew, M. Goodrich, D. Huttenlocher, K. Kedem, J. Kleinberg, and D. Kravets, Geometric Pattern Matching under Euclidean Motion, Proc. 5th Canadian Conf. Comput. Geom., pp. 151-156, 1993.
9. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial Complexity Bounds for Arrangements of Curves and Spheres, Discrete Comput. Geom., vol. 5, pp. 99-160, 1990.
10. G. Elekes and P. Erdös, Similar Configurations and Pseudo Grids, in Intuitive Geometry, Colloq. Math. Soc. Janos Bolyai. vol. 63, pp. 85-104. North-Holland, Amsterdam, 1994.
11. P. Erdös, On the Set of Distances of N Points, Amer. Math. Monthly, vol. 53, pp. 248-250, 1946.
12. P. Erdös, On the Set of Distances of N Points in Euclidean Space, Magyar Tud. Akad. Mat. Kut. Int. Közl., vol. 5, pp. 165-169, 1960. Also in Paul Erdös: The Art of Counting (Selected Writing) (J. Spencer, ed.) pp. 676-679, MIT Press, Cambridge, MA, 1973.
13. P. Erdös, On the Set of Distances of N Points in Euclidean Space, Magyar Tud. Akad. Mat. Kut. Int. Közl., vol. 5, pp. 165-169, 1960. Also in Paul Erdös: The Art of Counting (Selected Writing) (J. Spencer, ed.) pp. 676-679, MIT Press, Cambridge, MA, 1973.
14. P. Erdös and G. Purdy, Some Extremal Problems in Geometry, J. Combin. Theory, vol. 10, no. 3, pp. 246-252, 1971.
15. P. Finn, L. E. Kavraki, J. C. Latombe, R. Motwani, C. Shelton, S. Ventakatasubramanian, and A. Yao, RAPID: Randomized Pharmacophore Identification for Drug Design, Proc. 13th ACM Symp. on Computational Geometry, pp. 324-333.
16. M. T. Goodrich, J. S. B. Mitchell, and M. W. Orletsky, Practical Methods for Approximate Geometric Pattern Matching under Rigid Motions, Proc. 10th ACM Symp. on Comutational Geometry, pp. 103-112, 1994.
17. P. J. Heffernan. Generalized Approximate Algorithms for Point Sets Congruence, Proc. Workshop on Algorithms and Data Structures, pp. 373-384, 1993.
18. J. E. Hopcroft and D. P. Huttenlocher, Geometric Invariance on Computer Vision, Chapter 18, pp. 354-374, MIT Press, Cambridge, MA, 1992.
19. S. Irani and P. Raghavan, Combinatorial and Experimental Results for Randomized Point Matching Algorithms, Proc. 12th ACM Symp. on Computational Geometry, pp. 68-77, 1996.
20. N. Kiryai, Y. Eldar, and A. M. Bruckstein, A Probabilistic Hough Transform, Pattern Recognition, vol. 24, no. 4, pp. 303-316, 1991.
21. J. Matoušek, Combinatorial and Algorithmic Geometry, Unpublished lecture notes.
22. L. Moser, On the Different Distances Determined by N Points, Amer. Math. Monthly, vol. 59, pp. 85-91, 1952.
23. L. Moser and J. Pach, Recent Developments in Combinatorial Geometry, in New Trends in Discrete and Computational Geometry, (J. Pach, ed.), Algorithms and Combinatorics, vol. 10, Springer-Verlag, Berlin, 1993.
24. R. Motowani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
25. J. Pach and P. Aggarwal, Combinatorial Geometry, Series in Discrete Mathematics and Optimization, Wiley, New York, 1995.
26. J. Pach and G. Toth, Graphs Drawn with Few Crossings per Edge, Preprint, 1996.
27. P. J. de Rezende and D. T. Lee, Point Set Pattern Matching in d-Dimensions, Algorithmica, vol. 3, pp. 387-404, 1995.
28. K. Sugihara, An n log n Algorithm for Determining the Congruity of Polyhedra, J. Comput. System. Sci., vol. 29, pp. 36-47, 1984.
29. L. Székely, Crossing Numbers and Hard Erdös Problems in Discrete Geometry, Combinatorics, Probability and Computing, vol. 6, pp. 353-358, 1997.
30. E. Szemerédi and W.T. Trotter, Extremal Problems in Discrete Geometry, Combinatorica, vol. 3, pp. 381-392, 1983.
31. G. Vriend and C. Sander, Detection of Common Three-Dimensional Substructures in Proteins, PROTEINS: Structure, Function, and Genetics, vol. 11, pp. 52-58, 1991.