Combinatorial geometry problems in pattern recognition

Discrete and Computational Geometry

Volumn 28, Issue 4, 2002, Pages 495-510

  Braß, Peter ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036972768     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2884-3     Document Type: Article

References (32)

1. [AbF1] B.M. Ábrego, S. Fernández-Merchant: On the maximum number of equilateral triangles, I, Discrete Comput. Geom. 23 (2000), 129-135.
2. [AbF2] B.M. Ábrego, S. Fernández-Merchant: On the maximum number of congruent triangles among n points in three-dimensional space, manuscript.
3. [AgS] P.K. Agarwal, M. Sharir: On the number of congruent simplices in a point set, SCG 01 (17th ACM Symp. Comput. Geom.), 2001, pp. 1-9.
4. [AkTT] T. Akutsu, H. Tamaki, T. Tokuyama: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets, Discrete Comput. Geom. 20 (1998), 307-331.
5. [A1G] H. Alt, L.J. Guibas: Discrete geometric shapes: matching, interpolation, and approximation, in: Handbook of Computational Geometry, J.-R. Sack, J. Urrutia, eds., Elsevier, Amsterdam, 1999, pp. 121-153.
6. [Bo] L. Boxer: Point set pattern matching in 3-D, Pattern Recog. Lett. 17 (1996), 1293-1297.
7. [BoH] L. Boxer, R. Haralick: Even faster point set pattern matching in 3-D, Technical Report 2001-01 of the Department of Computer Science and Engineering, SUNY Buffalo.
8. [Brl] P. Braß: Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset, ESA 2000 (European Symp. Algorithms), M. Paterson, ed., LNCS 1879, Springer-Verlag, Berlin, 2000, pp. 112-119.
9. [Br2] P. Braß: On finding maximum-cardinality symmetric subsets, JCDCG 2000 (Jap. Conf. Discrete Comput. Geom.), J. Akiyama, M, Kano, M. Urabe, eds., LNCS 2098, Springer-Verlag, Berlin, 2001, pp. 106-112.
10. [BrK] P. Braß, C. Knauer: Testing the congruence of d-dimensional point sets, Proc. ACM Symp. Comput. Geom., ACM Press, New York, 2000, pp. 310-314.
11. [CaS] D. Cardoze, L.J. Schulman: Pattern matching for spatial point sets, Proc. 39th FOCS, IEEE Press. Piscataway, NJ, 1998, pp. 156-165.
12. 2 et géométrie de la suite des multiples de cet élément, Acta Arith. 78 (1996), 19-35.
13. [Ch2] N. Chevallier: Géométrie des suites de Kronecker, Manuscripta Math. 94 (1997), 231-241.
14. [Ch3] N. Chevallier: Three distance theorem and grid graph, Discrete Math. 223 (2000), 355-362.
15. +] K.L. Clarkson. H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl: Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Comput. Geom. 5 (1990), 99-160.
16. [E1E] G. Elekes, P. Erdos: Similar configurations and pseudo grids, in Intuitive Geometry, K. Böröczky et al., eds.. Colloq. Math. Soc. János Bolyai 63, North-Holland, Amsterdam, 1994, pp. 85-104.
17. [Er] P. Erdos: On sets of distances of n points, Amer. Math. Monthly 53 (1946), 248-250.
18. [ErHP] P. Erdos, D. Hickerson, J. Pach: A problem of Leo Moser about repeated distances on the sphere, Amer. Math. Monthly 96 (1989). 569-575.
19. [ErP] P. Erdos, G. Purdy: Some extremal problems in geometry, IV, Proc. 7th South-Eastern Conf. Combin. Graph Theory, Comput., Congressus Numerantium 17 Utilitas Math., Winnipeg, 1976, pp. 307-322.
20. [HuKK] O.P. Huttenlocher, K. Kedem, J.M. Kleinberg: On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane, Proc. ACM Symp. Comput. Geom., 1992, pp. 110-120.
21. [InV] P. Indyk, S. Venkatasubramanian: Approximate congruence in nearly linear time, Proc. ACM Symp. Discrete Algebra, 2000, pp. 354-360.
22. [KrB] M.J. van Krefeld, M.T. de Berg: Finding squares and rectangles in sets of points, WG 1989 (Graph-Theoretic Concepts Comput. Sci.), M. Nagl, ed., LNCS 411, Springer-Verlag, Berlin, 1989, pp. 341-355.
23. [LaR] M. Laczkovich, I.Z. Ruzsa: The number of homothetic subsets, in: The Mathematics of Paul Erdös, Vol. II, R.L. Graham et al., eds., Algorithms and Combinatorics Series 14, Springer-Verlag. New York, 1997, pp. 294-302.
24. [Li] F.L. Liang: A short proof of the 3d distance theorem, Discrete Math. 28 (1979), 325-326.
25. [Ma] J. Matoušek: Range searching with efficient hierarchical cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
26. [Na] M.B. Nathanson: Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Springer-Verlag, New York, 1996.
27. [ReL] P.J. de Rezende, D.T. Lee: Point set pattern matching in d-dimensions, Algorithmica 13 (1995), 387-404.
28. [Ru] W.J. Rucklidge: Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation, Discrete Comput. Geom. 16 (1996), 135-153.
29. [SpST] J. Spencer, E. Szemerédi, W. Trotter: Unit distances in the euclidean plane, in: Graph Theory and Combinatorics, B. Bollobás, ed., Academic Press, London, 1984, pp. 293-304.
30. [Sz] L.A. Székely: Crossing numbers and hard Erdos problems in discrete geometry, Combin. Probab. Comput. 6 (1997), 353-358.
31. [Ta] G. Talenti: The standard isoperimetric theorem, in Handbook of Convex Geometry, P.M. Gruber, J.M. Wills, eds., Elsevier, Amsterdam, 1993. pp. 73-123.
32. [WeKA] G. Weber, L. Knipping, H. Alt: An application of point pattern matching in astronautics, J. Symbolic Comput. 17 (1994), 321-340.