{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:12Z","timestamp":1742914212623,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_11","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"99-108","source":"Crossref","is-referenced-by-count":1,"title":["Computing Largest Empty Slabs"],"prefix":"10.1007","author":[{"given":"Jose Miguel","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"first","affiliation":[]},{"given":"Mario Alberto","family":"L\u00f3pez","sequence":"additional","affiliation":[]},{"given":"Joan Antoni","family":"Sellar\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02716576","volume":"15","author":"P. Agarwal","year":"1996","unstructured":"Agarwal, P., Schwarzkopf, O., Sharir, M.: The overlay of lower envelopes and its applications. Discrete and Computational Geometry\u00a015, 1\u201313 (1996)","journal-title":"Discrete and Computational Geometry"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-52921-7_80","volume-title":"Algorithms","author":"E.G. Anagnostou","year":"1990","unstructured":"Anagnostou, E.G., Guibas, L.J., Polimenis, V.G.: Topological sweeping in three dimensions. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol.\u00a0450, pp. 310\u2013317. Springer, Heidelberg (1990)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0097-3165(94)90027-2","volume":"65","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Matousek, J., Sharir, M.: On the sum of Squares of cell Complexities in Hyperplane Arrangements. J. Combin. Theory Ser. A\u00a065, 311\u2013321 (1994)","journal-title":"J. Combin. Theory Ser. A"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0167-8655(90)90080-L","volume":"11","author":"S. Chattopadhyay","year":"1990","unstructured":"Chattopadhyay, S., Das, P.: The k-dense corridor problems. Pattern Recogn. Lett.\u00a011, 463\u2013469 (1990)","journal-title":"Pattern Recogn. Lett."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(96)00070-1","volume":"58","author":"S.-W. Cheng","year":"1996","unstructured":"Cheng, S.-W.: Widest empty L-shaped corridor. Inf. Proc. Lett.\u00a058, 277\u2013283 (1996)","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1142\/S0218195903001207","volume":"13","author":"J.M. D\u00edaz-B\u00e1\u00f1ez","year":"2003","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Hurtado, F., Meijer, H., Rappaport, D., Sellar\u00e8s, T.: The largest empty annulus problem. International Journal of Computational Geometry and Applications\u00a013(4), 317\u2013325 (2003)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","volume":"38","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.: Topologically sweeping an arrangement. Journal of Computer and System Sciences\u00a038, 165\u2013194 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0218195997000351","volume":"7","author":"F. Follert","year":"1997","unstructured":"Follert, F., Sch\u00f6mer, E., Sellen, J., Smid, M., Thiel, C.: Computing a largest empty anchored cylinder and related problems. International Journal of Computational Geometry and Applications\u00a07, 563\u2013580 (1997)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR10","unstructured":"Houle, M., Maciel, A.: Finding the widest empty corridor through a set of points. In: Toussaint, G.T. (ed.) Snapshots of computational and discrete geometry, 210-213. TR SOCS-88.11, dept of Computer Science, McGill University, Canada (1988)"},{"key":"11_CR11","first-page":"231","volume":"1","author":"R. Janardan","year":"1994","unstructured":"Janardan, R., Preparata, F.P.: Widest-corridor problems. Nordic Journal of Computing\u00a01, 231\u2013245 (1994)","journal-title":"Nordic Journal of Computing"},{"key":"11_CR12","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00130-6","volume":"68","author":"C. Shin","year":"1998","unstructured":"Shin, C., Shin, S.Y., Chwa, K.: The widest k-dense corridor problems. Information Processing Letters\u00a068(1), 25\u201331 (1998)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:29:43Z","timestamp":1676690983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}