{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T13:23:53Z","timestamp":1774617833918,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T00:00:00Z","timestamp":1237248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00454-009-9152-8","type":"journal-article","created":{"date-parts":[[2009,3,16]],"date-time":"2009-03-16T11:50:48Z","timestamp":1237204248000},"page":"78-99","source":"Crossref","is-referenced-by-count":28,"title":["Can We Compute the Similarity between Surfaces?"],"prefix":"10.1007","volume":"43","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maike","family":"Buchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,3,17]]},"reference":[{"key":"9152_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H. Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Bl\u00f6mer, J.: Approximate matching of polygonal shapes. Ann. Math. Artif. Intell. 13, 251\u2013266 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9152_CR2","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-55566-4_4","volume-title":"Discrete and Computational Geometry. The Goodman\u2013Pollack Festschrift","author":"H. Alt","year":"2003","unstructured":"Alt, H., Bra\u00df, 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\u2013Pollack Festschrift. Algorithms and Combinatorics, vol. 25, pp. 65\u201376. Springer, Berlin (2003)"},{"key":"9152_CR3","doi-asserted-by":"crossref","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms 262\u2013283 (2003)","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"9152_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9152_CR5","first-page":"80","volume-title":"Proc. 22nd Annu. ACM Symp. Comput. Geom.","author":"K. Buchin","year":"2006","unstructured":"Buchin, K., Buchin, M., Wenk, C.: Computing the Fr\u00e9chet distance between simple polygons in polynomial time. In: Proc. 22nd Annu. ACM Symp. Comput. Geom., pp. 80\u201387. ACM Press, New York (2006)"},{"issue":"1","key":"9152_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"9152_CR7","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/978-3-540-30140-0_58","volume-title":"Proc. 12th Annu. European Symp. Algorithms","author":"I.Z. Emiris","year":"2004","unstructured":"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\u2013663. Springer, Berlin (2004)"},{"key":"9152_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M. Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rend. Circ. Mat. Palermo 22, 1\u201374 (1906)","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"9152_CR9","first-page":"4","volume":"3","author":"M. Fr\u00e9chet","year":"1924","unstructured":"Fr\u00e9chet, M.: Sur la distance de deux surfaces. Ann. Soc. Pol. Math. 3, 4\u201319 (1924)","journal-title":"Ann. Soc. Pol. Math."},{"key":"9152_CR10","unstructured":"Godau, M.: On the complexity of measuring the similarity between geometric objects in higher dimensions. PhD thesis, Freie Universit\u00e4t Berlin, Germany (1998)"},{"issue":"4","key":"9152_CR11","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"key":"9152_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9906-6","volume-title":"Geometric Topology in Dimensions 2 and 3","author":"E.E. Moise","year":"1977","unstructured":"Moise, E.E.: Geometric Topology in Dimensions 2 and 3. Graduate Texts in Mathematics, vol.\u00a047. Springer, Berlin (1977)"},{"key":"9152_CR13","series-title":"Mathematics and Visualization","volume-title":"Effective Computational Geometry for Curves and Surfaces","author":"B. Mourrain","year":"2006","unstructured":"Mourrain, B., Pion, S., Schmitt, S., T\u00e9court, 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)"},{"issue":"2\u20133","key":"9152_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.comgeo.2004.03.006","volume":"28","author":"R. Oostrum van","year":"2004","unstructured":"van Oostrum, R., Veltkamp, R.C.: Parametric search made practical. Comput. Geom. Theory Appl. 28(2\u20133), 75\u201388 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9152_CR15","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000)"},{"key":"9152_CR16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0304-3975(98)00045-0","volume":"234","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K., Zheng, X.: Computability on continuous, lower semi-continuous, and upper semi-continuous real functions. Theor. Comput. Sci. 234, 109\u2013133 (2000)","journal-title":"Theor. Comput. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9152-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-009-9152-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-009-9152-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:36Z","timestamp":1559072856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-009-9152-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3,17]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9152"],"URL":"https:\/\/doi.org\/10.1007\/s00454-009-9152-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3,17]]}}}