{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:59:03Z","timestamp":1725861543616},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_44","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"547-559","source":"Crossref","is-referenced-by-count":0,"title":["Polygon Simplification by Minimizing Convex Corners"],"prefix":"10.1007","author":[{"given":"Yeganeh","family":"Bahoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Durocher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Mark","family":"Keil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sahar","family":"Mehrpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"4","key":"44_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1142\/S0218195914600097","volume":"24","author":"O Aichholzer","year":"2014","unstructured":"Aichholzer, O., Hackl, T., Korman, M., Pilz, A., Vogtenhuber, B.: Geodesic-preserving polygon simplification. Int. J. Comput. Geom. Appl. 24(4), 307\u2013324 (2014)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/978-3-642-33090-2_10","volume-title":"Algorithms \u2013 ESA 2012","author":"L Arge","year":"2012","unstructured":"Arge, L., Deleuran, L., M\u00f8lhave, T., Revsb\u00e6k, M., Truelsen, J.: Simplifying massive contour maps. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 96\u2013107. Springer, Heidelberg (2012)"},{"issue":"3","key":"44_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M Berg de","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"44_CR4","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"Douglas, D.H., Peucker, T.K.: Algorithm for the reduction of the number of points required to represent a line or its caricature. Can. Cartographer 10(2), 112\u2013122 (1973)","journal-title":"Can. Cartographer"},{"issue":"4","key":"44_CR5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1142\/S0218195993000257","volume":"3","author":"LJ Guibas","year":"1993","unstructured":"Guibas, L.J., Hershberger, J., Mitchell, J.S.B., Snoeyink, J.: Approximating polygons and subdivisions with minimum link paths. Int. J. Comput. Geom. Appl. 3(4), 383\u2013415 (1993)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"44_CR6","unstructured":"Keil, J.M., Mitchell, J.S.B., Pradhan, D., Vatshelle, M.: An algorithm for the maximum weight independent set problem on outerstring graphs. In: Proceedings of CCCG, pp. 2\u20137 (2015)"},{"key":"44_CR7","unstructured":"Kempe, D.: On the complexity of the \u201creflections\u201d game (2003). http:\/\/www-bcf.usc.edu\/dkempe\/publications\/reflections.pdf"},{"key":"44_CR8","volume-title":"Generalisation of Geographic Information: Cartographic Modelling and Applications","author":"WA Mackaness","year":"2011","unstructured":"Mackaness, W.A., Ruas, A., Sarjakoski, L.T.: Generalisation of Geographic Information: Cartographic Modelling and Applications. Elsevier, Amsterdam (2011)"},{"key":"44_CR9","doi-asserted-by":"crossref","DOI":"10.1533\/9780857099518","volume-title":"Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry","author":"H Ratschek","year":"2003","unstructured":"Ratschek, H., Rokne, J.: Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry. Horwood Publishing, Chichester (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:21Z","timestamp":1498329861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}