{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T01:49:07Z","timestamp":1744422547644,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219306"},{"type":"electronic","value":"9783642219313"}],"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-21931-3_11","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T14:11:35Z","timestamp":1308319895000},"page":"132-140","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic Homotopic Path Simplification Algorithm"],"prefix":"10.1007","author":[{"given":"Shervin","family":"Daneshpajouh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"de Berg, M., van Kreveld, M., Schirra, S.: A New Approach to Subdivision Simplification. In: Twelfth International Symposium on Computer Assisted Cartography, vol.\u00a004, pp. 79\u201388 (1995)"},{"key":"11_CR2","first-page":"243","volume":"25","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartography and GIS\u00a025, 243\u2013257 (1998)","journal-title":"Cartography and GIS"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Buzer, L.: Optimal Simplification of Polygonal Chain for Rendering. In: 23rd ACM Symposium on Computational Geometry (SoCG), pp. 168\u2013174 (2007)","DOI":"10.1145\/1247069.1247102"},{"key":"11_CR4","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":"11_CR5","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., Harpeled, S., Mustafa, N.H., Wang, Y.: Near-linear time approximation algorithms for curve simplification. Algorithmica\u00a042, 203\u2013219 (2005)","journal-title":"Algorithmica"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1142\/S0218195906001951","volume":"16","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Asano, T., Katoh, N., Mehlhorn, K., Tokuyama, T.: Polyline fitting of planar points under min-sum criteria. International Journal of Computational Geometry and Applications\u00a016, 97\u2013116 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplifications. In: Proc. ACM Symposium on Computational Geometry (SoCG), pp. 175\u2013183 (2007)","DOI":"10.1145\/1247069.1247103"},{"issue":"2","key":"11_CR8","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(2), 112\u2013122 (1973)","journal-title":"Canadian Cartographer"},{"key":"11_CR9","unstructured":"Hershberger, J., Snoeyink, J.: Speeding up the Douglas-Peucker line simplification algorithm. In: Proceeding of 5th International Symposium on Spatial Data Handling, pp. 134\u2013143 (1992)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/02693799208901921","volume":"6","author":"Z. Li","year":"1992","unstructured":"Li, Z., Openshaw, S.: Algorithms for automated line generalization based on a natural principle of objective generalization. International Journal of Geographic Information Systems\u00a06, 373\u2013389 (1992)","journal-title":"International Journal of Geographic Information Systems"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0146-664X(82)90011-9","volume":"19","author":"Y. Kurozumi","year":"1982","unstructured":"Kurozumi, Y., Davis, W.A.: Polygonal approximation by the minimax method. Comput. Graph. Image Process\u00a019, 248\u2013264 (1982)","journal-title":"Comput. Graph. Image Process"},{"key":"11_CR12","unstructured":"Hobby, J.D.: Polygonal approximations that minimize the number of inflections. In: Proceeding of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 93\u2013102 (1993)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Asano, T., Katoh, N.: Number theory helps line detection in digital images. In: In Proceeding of 4th Annual International Symposium on Algorithms and Computing, vol.\u00a0762, pp. 313\u2013322 (1993)","DOI":"10.1007\/3-540-57568-5_262"},{"issue":"4","key":"11_CR14","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(4), 383\u2013415 (1993)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Estkowski, R., Mitchell, J.S.: Simplifying a polygonal subdivision while keeping it simple. In: Proceedings of the 17th Annual Symposium on Computational Geometry, pp. 40\u201349 (2001)","DOI":"10.1145\/378583.378612"},{"key":"11_CR16","unstructured":"Daneshpajouh, S., Abam, M.A., Deleuran, L., Ghodsi, M.: Computing Strongly Homotopic Line Simplification in the Plane. In: European Workshop on Computational Geometry (2011)"},{"key":"11_CR17","doi-asserted-by":"publisher","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, New York (1985)"},{"key":"11_CR18","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the convex hull of a set of points in a polygon. In: Proceeding of Signal Processing III: Theories and Applications, EURASIP 1986, Part 2, pp. 853\u2013856 (1986)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Hall-Holt, O., Katz, M., Mitchell, J.: Computing the visibility graph of points within a polygon. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 27\u201335 (2004)","DOI":"10.1145\/997817.997825"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. Journal of Comput. Syst. Sci.\u00a039, 126\u2013152 (1989)","journal-title":"Journal of Comput. Syst. Sci."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments. In: Proceeding of 3rd Annual International Symposium on Algorithms and Computing, vol.\u00a0650, pp. 378\u2013387 (1992)","DOI":"10.1007\/3-540-56279-6_90"},{"key":"11_CR22","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"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21931-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T19:35:58Z","timestamp":1553801758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21931-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219306","9783642219313"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21931-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}