{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T00:48:55Z","timestamp":1769042935331,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T00:00:00Z","timestamp":1408752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00453-014-9893-5","type":"journal-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T15:52:00Z","timestamp":1408722720000},"page":"1097-1129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Space\u2013Time Trade-offs for Stack-Based Algorithms"],"prefix":"10.1007","volume":"72","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":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,23]]},"reference":[{"key":"9893_CR1","unstructured":"Abrahamsen, M.: Constant-workspace algorithms for visibility problems in the plane. Master\u2019s thesis, University of Copenhagen (2013) http:\/\/www.diku.dk\/forskning\/~performance-engineering\/Mikkel\/thesis.pdf"},{"key":"9893_CR2","unstructured":"Abrahamsen, M.: An optimal algorithm computing edge-to-edge visibility in a simple polygon. In: CCCG, pp. 157\u2013162 (2013)"},{"issue":"2","key":"9893_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1023\/A:1018373005182","volume":"10","author":"M Akra","year":"1998","unstructured":"Akra, M., Bazzi, L.: On the solution of linear recurrence equations. Comput. Optim. Appl. 10(2), 195\u2013210 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"9893_CR4","unstructured":"Aloupis, G.: A history of linear-time convex hull algorithms for simple polygons. http:\/\/cgm.cs.mcgill.ca\/~athens\/cs601\/"},{"key":"9893_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"9893_CR6","doi-asserted-by":"crossref","unstructured":"Asano, T., Buchin, K., Buchin, M., Korman, M., Mulzer, W., Rote, G., Schulz, A.: Memory-constrained algorithms for simple polygons. Comput. Geom. 46(8), 959\u2013969 (2013)","DOI":"10.1016\/j.comgeo.2013.04.005"},{"issue":"1","key":"9893_CR7","first-page":"46","volume":"2","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. J. Comput. Geom. 2(1), 46\u201368 (2011)","journal-title":"J. Comput. Geom."},{"issue":"5","key":"9893_CR8","doi-asserted-by":"crossref","first-page":"569","DOI":"10.7155\/jgaa.00240","volume":"15","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Wang, Y.: Constant-work-space algorithms for shortest paths in trees and simple polygons. J. Graph Algorithms Appl. 15(5), 569\u2013586 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"9893_CR9","unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.: Space\u2013time trade-offs for stack-based algorithms. In STACS, pp. 281\u2013292 (2013)"},{"key":"9893_CR10","doi-asserted-by":"crossref","unstructured":"Barba, L., Korman, M., Langerman, S., Silveira, R. I.: Computing the visibility polygon using few variables. Comput. Geom. Theory Appl. 47(9), 918\u2013926 (2014)","DOI":"10.1016\/j.comgeo.2014.04.001"},{"key":"9893_CR11","doi-asserted-by":"crossref","unstructured":"Bloch, I.: Unifying quantitative, semi-quantitative and qualitative spatial relation knowledge representations using mathematical morphology. In TFCV, pp. 153\u2013164 (2003)","DOI":"10.1007\/3-540-36586-9_10"},{"key":"9893_CR12","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Comput. Geom. Theory Appl. 34(2), 75\u201382 (2006)","DOI":"10.1016\/j.comgeo.2005.11.005"},{"key":"9893_CR13","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Comparison-based time-space lower bounds for selection. ACM Trans Algorithms, 6:26:1\u201326:16 (2010)","DOI":"10.1145\/1721837.1721842"},{"issue":"1","key":"9893_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00454-006-1275-6","volume":"37","author":"TM Chan","year":"2007","unstructured":"Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. Discret. Comput. Geom. 37(1), 79\u2013102 (2007)","journal-title":"Discret. Comput. Geom."},{"key":"9893_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discret. Comput. Geom. 6, 485\u2013524 (1991)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"9893_CR16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00453-005-1201-y","volume":"44","author":"J Chun","year":"2006","unstructured":"Chun, J., Sadakane, K., Tokuyama, T.: Linear time algorithm for approximating a curve by a single-peaked curve. Algorithmica 44(2), 103\u2013115 (2006)","journal-title":"Algorithmica"},{"key":"9893_CR17","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Deterministic CFL\u2019s are accepted simultaneously in polynomial time and log squared space. In STOCS, pp. 338\u2013345 (1979)","DOI":"10.1145\/800135.804426"},{"key":"9893_CR18","unstructured":"De, M., Maheshwari, A., Nandy, S.C.: Space-efficient algorithms for visibility problems in simple polygon. CoRR, abs\/1204.2634 (2012)"},{"key":"9893_CR19","unstructured":"De, M., Nandy, S.C., Roy, S.: Convex hull and linear programming in read-only setup with limited work-space. CoRR, abs\/1212.5353 (2012)"},{"issue":"1","key":"9893_CR20","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/331605.331607","volume":"47","author":"PW Dymond","year":"2000","unstructured":"Dymond, P.W., Ruzzo, W.L.: Parallel RAMs with owned global memory and deterministic context-free language recognition. J. ACM 47(1), 16\u201345 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"9893_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Syst. Sci. 34(1), 19\u201326 (1987)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9893_CR22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/383891.383893","volume":"26","author":"T Fukuda","year":"2001","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association rules. ACM Trans. Database Syst. 26(2), 179\u2013213 (2001)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"9893_CR23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","volume":"7","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E.: Triangulating a simple polygon. Inf. Process. Lett. 7(4), 175\u2013179 (1978)","journal-title":"Inf. Process. Lett."},{"key":"9893_CR24","doi-asserted-by":"crossref","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, Cambridge (2007)"},{"key":"9893_CR25","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"},{"issue":"2","key":"9893_CR26","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"9893_CR27","unstructured":"Jacobson, G.: Succinct Static Data Structures. PhD thesis, Carnegie-Mellon, Jan. 1989. Tech Rep CMU-CS-89-112"},{"issue":"1","key":"9893_CR28","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"R Jarvis","year":"1973","unstructured":"Jarvis, R.: On the identification of the convex hull of a finite set of points in the plane. Inf. Process. Lett. 2(1), 18\u201321 (1973)","journal-title":"Inf. Process. Lett."},{"key":"9893_CR29","doi-asserted-by":"crossref","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 Numer. Math. 27, 458\u2013473 (1987)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"9893_CR30","first-page":"87","volume":"12","author":"DT Lee","year":"1983","unstructured":"Lee, D.T.: On finding the convex hull of a simple polygon. Int. J. Parallel Program. 12(2), 87\u201398 (1983)","journal-title":"Int. J. Parallel Program."},{"key":"9893_CR31","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 607\u2013642. CRC Press LLC, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch27"},{"key":"9893_CR32","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1023\/A:1009755828992","volume":"2","author":"Y Morimoto","year":"1997","unstructured":"Morimoto, Y., Fukuda, T., Morishita, S., Tokuyama, T.: Implementation and evaluation of decision trees with range and region splitting. Constraints 2, 401\u2013427 (1997)","journal-title":"Constraints"},{"key":"9893_CR33","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315\u2013323 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"9893_CR34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"JI Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theor. Comput. Sci. 165, 311\u2013323 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9893_CR35","volume-title":"Computational Geometry in C","author":"J O\u2019Rourke","year":"1994","unstructured":"O\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1994)"},{"key":"9893_CR36","first-page":"643","volume-title":"Handbook of Discrete and Computational Geometry","author":"J O\u2019Rourke","year":"2004","unstructured":"O\u2019Rourke, J.: Visibility. Handbook of Discrete and Computational Geometry, vol. 28, 2nd edn, pp. 643\u2013664. CRC Press Inc., Boca Raton (2004)","edition":"2"},{"key":"9893_CR37","doi-asserted-by":"crossref","unstructured":"Pilz, A.: Personal communication (2013)","DOI":"10.7767\/sus-2013-0146"},{"key":"9893_CR38","doi-asserted-by":"crossref","unstructured":"Raman, V., Ramnath, S.: Improved upper bounds for time-space tradeoffs for selection with limited storage. In SWAT, pp. 131\u2013142 (1998)","DOI":"10.1007\/BFb0054361"},{"issue":"1\/2","key":"9893_CR39","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0019-9958(83)80049-7","volume":"56","author":"B Braunm\u00fchl von","year":"1983","unstructured":"von Braunm\u00fchl, B., Cook, S.A., Mehlhorn, K., Verbeek, R.: The recognition of deterministic CFL\u2019s in small time and space. Inf. Control 56(1\/2), 34\u201351 (1983)","journal-title":"Inf. Control"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9893-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9893-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9893-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T02:19:32Z","timestamp":1565749172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9893-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,23]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9893"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9893-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,23]]}}}