Can we compute the similarity between surfaces?

Discrete and Computational Geometry

Volumn 43, Issue 1, 2009, Pages 78-99

  Alt, Helmut ^a   Buchin, Maike ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Fr chet distance; Shape matching; Surfaces

Indexed keywords

EID: 72249088396     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9152-8     Document Type: Article

References (16)

1. Alt, H., Behrends, B., Blömer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251-266 (1995).
2. Alt, H., Braß, P., Godau, M., Knauer, C., Wenk, C.: Computing the Hausdorff 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).
3. Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms 262-283 (2003).
4. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75-91 (1995).
5. Buchin, K., Buchin, M., Wenk, C.: Computing the Fréchet distance between simple polygons in polynomial time. In: Proc. 22nd Annu. ACM Symp. Comput. Geom., pp. 80-87. ACM Press, New York (2006).
6. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200-208 (1987).
7. Emiris, I.Z., Tsigaridas, E.P.: Comparing real algebraic numbers of small degree. In: Proc. 12th Annu. European Symp. Algorithms. Lecture Notes Comput. Sci., vol. 3221, pp. 652-663. Springer, Berlin (2004).
8. Fréchet, M.: Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo 22, 1-74 (1906).
9. Fréchet, M.: Sur la distance de deux surfaces. Ann. Soc. Pol. Math. 3, 4-19 (1924).
10. Godau, M.: On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universität Berlin, Germany (1998).
11. Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852-865 (1983).
12. Moise, E.E.: Geometric Topology in Dimensions 2 and 3. Graduate Texts in Mathematics, vol. 47. Springer, Berlin (1977).
13. Mourrain, B., Pion, S., Schmitt, S., Técourt, J.-P., Tsigaridas, E., Wolpert, N.: Algebraic issues in computational geometry. In: Boissonnat, J.-D., Teillaud, M. (eds.) Effective Computational Geometry for Curves and Surfaces. Mathematics and Visualization. Springer, Berlin (2006).
14. van Oostrum, R., Veltkamp, R.C.: Parametric search made practical. Comput. Geom. Theory Appl. 28(2-3), 75-88 (2004).
15. Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000).
16. Weihrauch, K., Zheng, X.: Computability on continuous, lower semi-continuous, and upper semi-continuous real functions. Theor. Comput. Sci. 234, 109-133 (2000).