{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:02Z","timestamp":1725638222079},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"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-25591-5_9","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"70-79","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Visibility Polygon Using Few Variables"],"prefix":"10.1007","author":[{"given":"Luis","family":"Barba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithm for geometric problems. Submitted to Journal of Computational Geometry (2010)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-11440-3_2","volume-title":"WALCOM: Algorithms and Computation","author":"T. Asano","year":"2010","unstructured":"Asano, T., Mulzer, W., Wang, Y.: Constant-work-space Algorithm for a Shortest Path in a Simple Polygon. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 9\u201320. Springer, Heidelberg (2010)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Asano, T., Rote, G.: Constant-working-space algorithms for geometric problems. In: CCCG, pp. 87\u201390 (2009)","DOI":"10.1007\/978-3-642-00826-9_12"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Carmi, P., Hurtado, F., Morin, P.: A generalized Winternitz theorem. Journal of Geometry (in press)","DOI":"10.1007\/s00022-011-0076-0"},{"key":"9_CR5","first-page":"1","volume":"6","author":"T.M. Chan","year":"2010","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. ACM Trans. Algorithms\u00a06, 26:1\u201326:16 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9_CR6","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"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: A note on the height of binary search trees. J. ACM\u00a033, 489\u2013498 (1986)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Syst. Sci.\u00a034(1), 19\u201326 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S. Ghosh","year":"2007","unstructured":"Ghosh, S.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: SIGMOD, pp. 58\u201366 (2001)","DOI":"10.1145\/375663.375670"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B. Joe","year":"1987","unstructured":"Joe, B., Simpson, R.B.: Corrections to Lee\u2019s visibility polygon algorithm. BIT Numerical Mathematics\u00a027, 458\u2013473 (1987), doi:10.1007\/BF01937271","journal-title":"BIT Numerical Mathematics"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J.I. Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci.\u00a012, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR13","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. Theor. Comput. Sci.\u00a0165, 311\u2013323 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Visibility. In: Handbook of Discrete and Computational Geometry, 2nd edn., ch. 28, pp. 643\u2013664. CRC Press, Inc. (2004)","DOI":"10.1201\/9781420035315.ch28"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0054361","volume-title":"Algorithm Theory - SWAT\u201998","author":"V. Raman","year":"1998","unstructured":"Raman, V., Ramnath, S.: Improved Upper Bounds for Time-space Tradeoffs for Selection with Limited Storage. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 131\u2013142. Springer, Heidelberg (1998)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Seidel, R.: Convex hull computations. In: Handbook of Discrete and Computational Geometry, 2nd edn., ch. 22, pp. 495\u2013512. CRC Press, Inc. (2004)","DOI":"10.1201\/9781420035315.pt3"}],"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-25591-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T11:15:20Z","timestamp":1686482120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}