{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:15Z","timestamp":1725544035912},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_2","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"9-20","source":"Crossref","is-referenced-by-count":1,"title":["Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]},{"given":"Yajun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Asano, T., Rote, G.: Constant-Working-Space Algorithms for Geometric Problems. In: Proc. CCCG 2009, Vancouver, pp. 87\u201390 (2009)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-92182-0_1","volume-title":"Algorithms and Computation","author":"T. Asano","year":"2008","unstructured":"Asano, T.: Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array? In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, p. 1. Springer, Heidelberg (2008)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/978-3-642-00826-9_12","volume-title":"ETVC 2008","author":"T. Asano","year":"2009","unstructured":"Asano, T.: Constant-Working-Space Algorithms for Image Processing. In: Nielsen, F. (ed.) ETVC 2008. LNCS, vol.\u00a05416, pp. 268\u2013283. Springer, Heidelberg (2009)"},{"key":"2_CR4","unstructured":"Asano, T.: Constant-Working-Space Image Scan with a Given Angle. In: Proc. 24th European Workshop on Computational Geometry, Nancy, France, March 18-20, pp. 165\u2013168 (2008)"},{"key":"2_CR5","unstructured":"Asano, T.: Constant-Working Space Algorithm for Image Processing. In: Proc. of the First AAAC Annual meeting, Hong Kong, April 26-27, p. 3 (2008)"},{"key":"2_CR6","doi-asserted-by":"crossref","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"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00454-006-1275-6","volume":"37","author":"T.M. Chan","year":"2007","unstructured":"Chan, T.M., Chen, E.Y.: Multi-Pass Geometric Algorithms. Discrete & Computational Geometry\u00a037(1), 79\u2013102 (2007)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete & Computational Geometry\u00a06(1), 485\u2013524 (1991)","journal-title":"Discrete & Computational Geometry"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoretical Computer Science\u00a0165, 311\u2013323 (1996)","journal-title":"Theoretical Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM\u00a055, 24, Article #17 (2008)","DOI":"10.1145\/1391289.1391291"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:33Z","timestamp":1606185633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}