{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:22:07Z","timestamp":1760440927838},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_19","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"217-228","source":"Crossref","is-referenced-by-count":4,"title":["Distance-Preserving Approximations of Polygonal Paths"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/BFb0032068","volume-title":"Automata, Languages and Programming","author":"H. Alt","year":"1990","unstructured":"Alt, H., Bl\u00f6mer, J., Godau, M., Wagener, H.: Approximation of convex polygons. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 703\u2013716. Springer, Heidelberg (1990)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Barequet, G., Goodrich, M.T., Chen, D.Z., Daescu, O., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. In: Proceedings 14th Annual ACM Symposium on Computational Geometry, pp. 317\u2013326 (1998)","DOI":"10.1145\/276884.276920"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM\u00a042, 67\u201390 (1995)","journal-title":"Journal of the ACM"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/S0218195996000058","volume":"6","author":"W.S. Chan","year":"1996","unstructured":"Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry & Applications\u00a06, 59\u201377 (1996)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0218195903001086","volume":"13","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Daescu, O.: Space-efficient algorithms for approximating polygonal curves in two-dimensional space. International Journal of Computational Geometry & Applications\u00a013, 95\u2013111 (2003)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"19_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"M.T. Goodrich","year":"1995","unstructured":"Goodrich, M.T.: Efficient piecewise-linear function approximation using the uniform metric. Discrete & Computational Geometry\u00a014, 445\u2013462 (1995)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0218195993000257","volume":"3","author":"L.J. Guibas","year":"1993","unstructured":"Guibas, L.J., Hershberger, J.E., Mitchell, J.S.B., Snoeyink, J.S.: Approximating polygons and subdivisions with minimum link paths. International Journal of Computational Geometry & Applications\u00a03, 383\u2013415 (1993)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","volume":"36","author":"H. Imai","year":"1986","unstructured":"Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing\u00a036, 31\u201341 (1986)","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"19_CR10","first-page":"71","volume-title":"Computational Morphology","author":"H. Imai","year":"1988","unstructured":"Imai, H., Iri, M.: Polygonal approximations of a curve-formulations and algorithms. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71\u201386. North-Holland, Amsterdam (1988)"},{"key":"19_CR11","first-page":"87","volume-title":"Computational Morphology","author":"A. Melkman","year":"1988","unstructured":"Melkman, A., O\u2019Rourke, J.: On polygonal chain approximation. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 87\u201395. North-Holland, Amsterdam (1988)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.R.: Approximating monotone polygonal curves using the uniform metric. In: Proceedings 12th Annual ACM Symposium on Computational Geometry, pp. 311\u2013318 (1996)","DOI":"10.1145\/237218.237400"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:14:04Z","timestamp":1552832044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}