{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:22Z","timestamp":1725559162123},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_9","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"77-88","source":"Crossref","is-referenced-by-count":4,"title":["Polyline Fitting of Planar Points Under Min-sum Criteria"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuo","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02574380","volume":"12","author":"A. Aggarwal","year":"1994","unstructured":"Aggarwal, A., Schieber, B., Tokuyama, T.: Finding a minimum-weight k-link path in graphs with the concave Monge property and applications. Discrete Comput. Geom.\u00a012, 263\u2013280 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/PL00009348","volume":"19","author":"P. Agarwal","year":"1998","unstructured":"Agarwal, P., Aronov, B., Chan, T., Sharir, M.: On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Discrete Comput. Geom.\u00a019, 315\u2013331 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0222051","volume":"22","author":"P. Agarwal","year":"1993","unstructured":"Agarwal, P., Matou\u0161ek, J.: Ray shooting and parametric search. SIAM J. Comput.\u00a022, 794\u2013806 (1993)","journal-title":"SIAM J. Comput."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-540-24587-2_3","volume-title":"Algorithms and Computation","author":"J. Chun","year":"2003","unstructured":"Chun, J., Sadakane, K., Tokuyama, T.: Linear time algorithm for approximating a curve by a single-peaked curve. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 6\u201316. Springer, Heidelberg (2003)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF02187741","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Application of Random Sampling in Computational Geometry. Discrete Comput. Geom.\u00a04, 423\u2013432 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"M. Goodrich","year":"1995","unstructured":"Goodrich, M.: Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geom.\u00a014, 445\u2013462 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/1049-9652(91)90056-P","volume":"53","author":"S. Hakimi","year":"1991","unstructured":"Hakimi, S., Schmeichel, E.: Fitting polygonal functions to a set of points in the plane. Graphical Models and Image Processing\u00a053, 132\u2013136 (1991)","journal-title":"Graphical Models and Image Processing"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01553880","volume":"4","author":"H. Imai","year":"1989","unstructured":"Imai, H., Kato, K., Yamamoto, P.: A linear-time algorithm for linear L\n                        1 approximation of points. Algorithmica\u00a04, 77\u201396 (1989)","journal-title":"Algorithmica"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Katoh, N., Tokuyama, T.: Notes on computing peaks in k-levels and parametric spanning trees. In: Proc. 17th ACM Symp. on Computational Geometry, pp. 241\u2013248 (2001)","DOI":"10.1145\/378583.378675"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-36494-3_6","volume-title":"STACS 2003","author":"S. Langerman","year":"2003","unstructured":"Langerman, S., Steiger, W.: Optimization in arrangements. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 50\u201361. Springer, Heidelberg (2003)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete Comput. Geom.\u00a08, 315\u2013334 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cutting. In: Proc. 8th ACM Symp. on Comput. Geom, pp. 276\u2013287 (1992)","DOI":"10.1145\/142675.142732"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1145\/197405.197408","volume":"26","author":"J. Matou\u0161ek","year":"1994","unstructured":"Matou\u0161ek, J.: Geometric range searching. ACM Computing Surveys\u00a026, 421\u2013461 (1994)","journal-title":"ACM Computing Surveys"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Schwarzkopf, O.: Linear optimization queries. In: Proc. 8th Annual ACM Symp. Comput. Geom, pp. 16\u201325 (1992)","DOI":"10.1145\/142675.142683"},{"key":"9_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry, an Introduction. Springer-Verlag, New York (1985)"},{"key":"9_CR16","volume-title":"Handbook of Discrete and Computational Geometry","author":"J. Salowe","year":"1997","unstructured":"Salowe, J.: Parametric Search. In: Goodman, J., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, vol.\u00a037, CRC Press, Boca Raton (1997)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:44Z","timestamp":1620012584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}