{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:07:29Z","timestamp":1743127649930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_40","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"482-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Time-Space Trade-offs for Triangulations and Voronoi Diagrams"],"prefix":"10.1007","author":[{"given":"Matias","family":"Korman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Roeloffzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seiferth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannik","family":"Stein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"8","key":"40_CR1","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.comgeo.2013.04.005","volume":"46","author":"T Asano","year":"2013","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)","journal-title":"Comput. Geom."},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-38236-9_4","volume-title":"Theory and Applications of Models of Computation","author":"T Asano","year":"2013","unstructured":"Asano, T., Elmasry, A., Katajainen, J.: Priority queues and sorting for read-only data. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 32\u201341. Springer, Heidelberg (2013)"},{"key":"40_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-40104-6_6","volume-title":"Algorithms and Data Structures","author":"T Asano","year":"2013","unstructured":"Asano, T., Kirkpatrick, D.: Time-space tradeoffs for all-nearest-larger-neighbors problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 61\u201372. Springer, Heidelberg (2013)"},{"issue":"1","key":"40_CR4","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. of Comput. Geom. 2(1), 46\u201368 (2011)","journal-title":"J. of Comput. Geom."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Barba, L., Korman, M., Langerman, S., Sadakane, K., Silveira, R.: Space-time trade-offs for stack-based algorithms. Algorithmica 1\u201333 (2014)","DOI":"10.1007\/s00453-014-9893-5"},{"issue":"9","key":"40_CR6","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.comgeo.2014.04.001","volume":"47","author":"L Barba","year":"2013","unstructured":"Barba, L., Korman, M., Langerman, S., Silveira, R.I.: Computing the visibility polygon using few variables. Comput. Geom. 47(9), 918\u2013926 (2013)","journal-title":"Comput. Geom."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry: Algorithms and applications, third edition. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A Borodin","year":"1982","unstructured":"Borodin, A., Cook, S.: A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput. 11, 287\u2013297 (1982)","journal-title":"SIAM J. Comput."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Chan, T.M., Chen, E.Y.: Towards in-place geometric algorithms and data structures. In: Proc. 20th Annu. ACM Sympos. Comput. Geom. (SoCG), pp. 239\u2013246 (2004)","DOI":"10.1145\/997817.997854"},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","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. Discrete Comput. Geom. 37(1), 79\u2013102 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"40_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02122778","volume":"10","author":"B Chazelle","year":"1990","unstructured":"Chazelle, B., Friedman, J.: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3), 229\u2013249 (1990)","journal-title":"Combinatorica"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-662-44777-2_24","volume-title":"Algorithms - ESA 2014","author":"O Darwish","year":"2014","unstructured":"Darwish, O., Elmasry, A.: Optimal time-space tradeoff for the 2D convex-hull problem. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 284\u2013295. Springer, Heidelberg (2014)"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/357337.357341","volume":"3","author":"A Fournier","year":"1984","unstructured":"Fournier, A., Montuno, D.Y.: Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics 3, 153\u2013174 (1984)","journal-title":"ACM Transactions on Graphics"},{"key":"40_CR15","unstructured":"Har-Peled, S.: Shortest path in a polygon using sublinear space. To appear in: SoCG 2015"},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","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. Inform. Process. Lett. 2(1), 18\u201321 (1973)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"40_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"40_CR18","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 12, 315\u2013323 (1980)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"40_CR19","doi-asserted-by":"publisher","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. Theoret. Comput. Sci. 165(2), 311\u2013323 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Pagter, J., Rauhe, T.: Optimal time-space trade-offs for sorting. In: Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), pp. 264\u2013268 (1998)","DOI":"10.7146\/brics.v5i10.19282"},{"key":"40_CR21","unstructured":"Pohl, I.: A minimum storage algorithm for computing the median. Technical Report RC2701, IBM (1969)"},{"key":"40_CR22","unstructured":"Savage, J.E.: Models of computation\u2013exploring the power of computing. Addison-Wesley (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T05:47:05Z","timestamp":1676958425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}