The computational geometry of comparing shapes

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

Volumn 5760 LNCS, Issue , 2009, Pages 235-248

  Alt, Helmut ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Computability; Computational geometry; Distance measures; Shapes

Indexed keywords

COMPUTABILITY; DECISION PROBLEMS; DISTANCE MEASURE; DISTANCE MEASURES; HAUSDORFF DISTANCE; HUMAN OBSERVERS; SHAPES; THREE DIMENSIONAL SPACE; WORKGROUPS;

ALGORITHMS; COMPUTATIONAL EFFICIENCY;

COMPUTATIONAL GEOMETRY;

EID: 70349865189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03456-5_16     Document Type: Conference Paper

References (17)

1. Alt, H., Scharf, L., Scholz, S.: Probabilistic matching and resemblance evaluation of shapes in trademark images. In: Proceedings of the ACM International Conference on Image and Video Retrieval (CIVR), Amsterdam, The Netherlands, pp. 533-540 (2007)
2. Alt, H., Behrends, B., Blömer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251-266 (1995)
3. Fréchet, M.: Sur quelques points du calcul fonctionnel. Rendiconti Circ. Mat. Palermo 22, 1-74 (1906)
4. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5, 75-91 (1995)
5. Gajentaan, A., Overmars, M.H.: On a class of O(n2) problems in computational geometry. Comput. Geom. 5, 165-185 (1995)
6. Alt, H., Braß, P., Godau, M., Knauer, C., Wenk, C.: Computing the Hausdor distance of geometric patterns and shapes. In: Aronov, B., Basu, S., Pach, J. Sharir, M. (eds.) Discrete and Computational Geometry. The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol.25, pp.65-76. Springer, Berlin (2003); SpecialIssue:The Goodman-Pollack-Festschrift (Aronov, B., Basu, S. Pach, J., Sharir, M.(eds.)
7. Fréchet, M.: Sur la distance de deux surfaces. Ann. Soc. Polonaise Math. 3, 4-19 (1924)
8. Godau, M.: On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universität Berlin, Germany (1998), http://www.diss.fu-berlin.de/1999/1/indexe.html
9. Tarski, A.: A decision method for elementary algebra and geometry. Santa Monica CA: RAND Corp. (1948)
10. Buchin, M.: On the Computability of the Frechet Distance Between Triangulated Surfaces. PhD thesis, Freie Universität Berlin, Germany (2007), http://www.diss.fu-berlin.de/
11. Alt, H., Buchin, M.: Can we compute the similarity between surfaces? J. on Disc. and Comput. Geom. (to appear), http://www.citebase.org/abstract?id=oai: arXiv.org:cs/0703011
12. Weihrauch, K., Zheng, X.: Computability on continuous, lower semi-continuous, and upper semi-continuous real functions. Theoretical Computer Science 234, 109-133 (2000)
13. Moise, E.E.: Geometric Topology in Dimensions 2 and 3. Graduate Texts in Mathematics, vol.47. Springer, Heidelberg (1977)
14. Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the fréchet distance. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.2010, pp. 63-74. Springer, Heidelberg (2001)
15. Alt, H., Scharf, L.: Shape matching by random sampling. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.5431, pp. 381-393. Springer, Heidelberg (2009)
16. Sharon, E., Mumford, D.: 2d-shape analysis using conformal mapping. Int. J. Comput. Vision 70(1), 55-75 (2006)
17. Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete & Computational Geometry 3, 237-256 (1988)