{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T23:09:49Z","timestamp":1717024189922},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T00:00:00Z","timestamp":1155772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2007,2,26]]},"DOI":"10.1007\/s10444-005-7473-6","type":"journal-article","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T05:29:04Z","timestamp":1155792544000},"page":"269-282","source":"Crossref","is-referenced-by-count":2,"title":["An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing"],"prefix":"10.1007","volume":"26","author":[{"given":"Evgeny","family":"Lipovetsky","sequence":"first","affiliation":[]},{"given":"Nira","family":"Dyn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,17]]},"reference":[{"key":"7473_CR1","unstructured":"M. Alexa, Mesh morphing STAR, Eurographics 2001 State-of-the-Art Reports (2001)."},{"key":"7473_CR2","doi-asserted-by":"crossref","unstructured":"H. Alt, U. Fuchs, G. Rote and G. Weber, Matching convex shapes with respect to the symmetric difference, in: European Symposium on Algorithms (1996) pp. 320\u2013333.","DOI":"10.1007\/3-540-61680-2_65"},{"key":"7473_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0021-9045(89)90131-7","volume":"56","author":"Z. Artstein","year":"1989","unstructured":"Z. Artstein, Piecewise linear approximations of set-valued maps, J. Approx. Theory 56 (1989) 41\u201347.","journal-title":"J. Approx. Theory"},{"key":"7473_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"8","author":"M. Atallah","year":"1983","unstructured":"M. Atallah, A linear time algorithm for the Hausdorff distance between convex polygons, Inform. Process. Lett. 8 (1983) 207\u2013209.","journal-title":"Inform. Process. Lett."},{"key":"7473_CR5","first-page":"9","volume-title":"Approximation Theory, Vol. X","author":"R. Baier","year":"2002","unstructured":"R. Baier, N. Dyn and E. Farkhi, Metric averages of one dimensional compact sets, in: Approximation Theory, Vol. X, eds. C. Chui, L.L. Schumaker and J. Stoeckler (Vanderbilt Univ. Press, Nashville, TN, 2002) pp. 9\u201322."},{"key":"7473_CR6","first-page":"95","volume-title":"Trends in Approximation Theory","author":"N. Dyn","year":"2001","unstructured":"N. Dyn and E. Farkhi, Spline subdivision schemes for compact sets with metric averages, in: Trends in Approximation Theory, eds. K. Kopotun, T. Lyche and M. Neamtu (Vanderbilt Univ. Press, Nashville, TN, 2001) pp. 95\u2013104."},{"issue":"4","key":"7473_CR7","first-page":"349","volume":"28","author":"N. Dyn","year":"2002","unstructured":"N. Dyn and E. Farkhi, Spline subdivision schemes for compact sets \u2013 a survey, Serdica Math. J. 28(4) (2002) 349\u2013360.","journal-title":"Serdica Math. J."},{"key":"7473_CR8","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M. Shamos, Computational Geometry: An Introduction, Texts and Monographs in Computer Science (Springer-Verlag, Berlin, 1985)."},{"key":"7473_CR9","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis (Princeton Univ. Press, Princeton, NJ, 1970)."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-005-7473-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-005-7473-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-005-7473-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:08:09Z","timestamp":1559135289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-005-7473-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,17]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,2,26]]}},"alternative-id":["7473"],"URL":"https:\/\/doi.org\/10.1007\/s10444-005-7473-6","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,17]]}}}
