{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:08Z","timestamp":1759639088993},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_1","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["Piecewise-Linear Approximations of Uncertain Functions"],"prefix":"10.1007","author":[{"given":"Mohammad Ali","family":"Abam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirali","family":"Khosravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00454-008-9132-4","volume":"43","author":"M.A. Abam","year":"2010","unstructured":"Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming Algorithms for Line Simplification. Discrete & Computational Geometry\u00a043, 497\u2013515 (2010)","journal-title":"Discrete & Computational Geometry"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Varadarajan, K.R.: Efficient Algorithms for Approximating Polygonal Chains. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Discrete & Computational Geometry, vol.\u00a023, pp. 273\u2013291 (2000)","DOI":"10.1007\/PL00009500"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-005-1165-y","volume":"42","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N.H., Wang, Y.: Near-linear Time Approximation Algorithms for Curve Simplification. Algorithmica\u00a042, 203\u2013219 (2005)","journal-title":"Algorithmica"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fre\u00e9chet Distance between Two Polygonal Curves. International Journal on Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal on Computational Geometry and Applications"},{"key":"1_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg De","year":"2008","unstructured":"De Berg, M., Cheong, O., Van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chan, W.S., Chin, F.: Approximation of Polygonal Curves with Minimum Number of Line Segments. In: Chazelle, B., Goodman, J., Pollack, R. (eds.) Proc. 3rd Annual Symp. on Alg. and Comp., vol.\u00a0650, pp. 378\u2013387 (1992)","DOI":"10.1007\/3-540-56279-6_90"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or its Caricature. Canadian Cartographer\u00a010, 112\u2013122 (1973)","journal-title":"Canadian Cartographer"},{"key":"1_CR8","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":"1_CR9","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 and Applications\u00a03, 383\u2013415 (1993)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/1049-9652(91)90056-P","volume":"52","author":"S.L. Hakimi","year":"1991","unstructured":"Hakimi, S.L., Schmeichel, E.F.: Fitting Polygonal Functions to a Set of Points in the Plane. Graph. Models Image Process.\u00a052, 132\u2013136 (1991)","journal-title":"Graph. Models Image Process."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Imai, H., Iri, M.: Polygonal Approximations of a Curve-formulations and Algorithms. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71\u201386 (1988)","DOI":"10.1016\/B978-0-444-70467-2.50011-4"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/S0097539794268649","volume":"26","author":"M.J. Katz","year":"1997","unstructured":"Katz, M.J., Sharir, M.: An Expander-based Approach to Geometric Optimization. SIAM J. Comput.\u00a026, 1384\u20131408 (1997)","journal-title":"SIAM J. Comput."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"36","author":"J. Matousek","year":"1991","unstructured":"Matousek, J.: Randomized Optimal Algorithm for Slope Selection. Inform. Process. Lett.\u00a036, 183\u2013187 (1991)","journal-title":"Inform. Process. Lett."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Melkman, A., O\u2019Rourke, J.: On Polygonal Chain Approximation. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 87\u201395 (1998)","DOI":"10.1016\/B978-0-444-70467-2.50012-6"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","volume":"35","author":"S. Suri","year":"1986","unstructured":"Suri, S.: A Linear Time Algorithm for Minimum Link Paths inside a Simple Polygon. Comput. Vision Graph. Image Process.\u00a035, 99\u2013110 (1986)","journal-title":"Comput. Vision Graph. Image Process."},{"key":"1_CR16","unstructured":"Toussaint, G.T.: On the Complexity of Approximating Polygonal Curves in the Plane. In: Proc. Int. Symp. on Robotics and Automation (1985)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-57568-5_283","volume-title":"Algorithms and Computation","author":"D.P. Wang","year":"1993","unstructured":"Wang, D.P., Huang, D.P., Chao, H.S., Lee, R.C.T.: Plane Sweep Algorithms for Polygonal Approximation Problems with Applications. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 515\u2013522. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:54:10Z","timestamp":1560466450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}