{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:33Z","timestamp":1725456993376},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_35","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"319-331","source":"Crossref","is-referenced-by-count":0,"title":["Robust Nonparametric Data Approximation of Point Sets via Data Reduction"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Leblanc","sequence":"additional","affiliation":[]},{"given":"Jason","family":"Morrison","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Skala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-45749-6_7","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Har-Peled, S., Mustafa, N.H., Wang, Y.: Near-Linear Time Approximation Algorithms for Curve Simplification. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 29\u2013202. Springer, Heidelberg (2002)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/PL00009500","volume":"23","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Varadarajan, K.R.: Efficient algorithms for approximating polygonal chains. Discrete and Computational Geometry\u00a023, 273\u2013291 (2000)","journal-title":"Discrete and Computational Geometry"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 121\u2013153. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., P\u01cetra\u015fcu, M.: Counting inversions, offline orthogonal range counting and related problems. In: SODA, pp. 161\u2013173 (2010)","DOI":"10.1137\/1.9781611973075.15"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-56279-6_90","volume-title":"Algorithms and Computation","author":"W.S. Chan","year":"1992","unstructured":"Chan, W.S., Chin, F.: Approximation of Polygonal Curves with Minimum Number of Line Segments. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol.\u00a0650, pp. 378\u2013387. Springer, Heidelberg (1992)"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D. Douglas","year":"1973","unstructured":"Douglas, D., Peucker, T.: Algorithms for the reduction of points required to represent a digitised line or its caricature. The Canadian Cartographer\u00a010, 112\u2013122 (1973)","journal-title":"The Canadian Cartographer"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jalgor.2003.09.001","volume":"50","author":"Y. Han","year":"2004","unstructured":"Han, Y.: Deterministic sorting in o(nloglogn) time and linear space. J. of Algorithms\u00a050, 96\u2013105 (2004)","journal-title":"J. of Algorithms"},{"key":"35_CR8","unstructured":"Han, Y., Thorup, M.: Integer sorting in \n                    \n                      \n                    \n                    $o(n\\sqrt{\\log \\log n})$\n                   expected time and linear space. In: FOCS, pp. 135\u2013144 (2002)"},{"issue":"3-4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-7721(98)00027-3","volume":"11","author":"J. Hershberger","year":"1998","unstructured":"Hershberger, J., Snoeyink, J.: Cartographic line simplification and polygon csg formulae in o(nlog*\n                  n) time. Computational Geometry: Theory and Applications\u00a011(3-4), 175\u2013185 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Imai, H., Iri, M.: Polygonal approximation of curve-formulations and algorithms. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71\u201386. North-Holland (1988)","DOI":"10.1016\/B978-0-444-70467-2.50011-4"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Melkman, A., O\u2019Rourke, J.: On polygonal chain approximation. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 87\u201395. North-Holland (1988)","DOI":"10.1016\/B978-0-444-70467-2.50012-6"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Skiena, S.S.: The Algorithm Design Manual, 2nd edn. Springer (2008)","DOI":"10.1007\/978-1-84800-070-4"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:15:35Z","timestamp":1557447335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}