{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:31:08Z","timestamp":1762342268467,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031555978"},{"type":"electronic","value":"9783031555985"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_20","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:01:53Z","timestamp":1709661713000},"page":"303-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum-Width Double-Slabs and\u00a0Widest Empty Slabs in\u00a0High Dimensions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6588-4431","authenticated-orcid":false,"given":"Taehoon","family":"Ahn","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3363-2406","authenticated-orcid":false,"given":"Chaeyoon","family":"Chung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8802-4247","authenticated-orcid":false,"given":"Sang Won","family":"Bae","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4467-7075","authenticated-orcid":false,"given":"Otfried","family":"Cheong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4664-7921","authenticated-orcid":false,"given":"Sang Duk","family":"Yoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02712871","volume":"16","author":"PK Agarwal","year":"1996","unstructured":"Agarwal, P.K., Sharir, M.: Efficient randomized algorithms for some geometric optimization problems. Discr. Comput. Geometry 16(4), 317\u2013337 (1996)","journal-title":"Discr. Comput. Geometry"},{"key":"20_CR3","unstructured":"Agarwal, P.K.: Range searching. In: Goodman, J., O\u2019Rourke, J., T\u00f3th, C. (eds.) Handbook of Discrete and Computational Geometry, chap. 40, pp. 1057\u20131092. CRC Press, 3rd edn. (2018)"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0196-6774(02)00295-X","volume":"46","author":"PK Agarwal","year":"2003","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. J. Algorithms 46(2), 115\u2013139 (2003)","journal-title":"J. Algorithms"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00453-005-1166-x","volume":"42","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: Approximation algorithms for a $$k$$-line center. Algorithmica 42(3), 221\u2013230 (2005)","journal-title":"Algorithmica"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2020.05.045","volume":"833","author":"SW Bae","year":"2020","unstructured":"Bae, S.W.: Minimum-width double-strip and parallelogram annulus. Theor. Comput. Sci. 833, 133\u2013146 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02570705","volume":"14","author":"M de Berg","year":"1995","unstructured":"de Berg, M., Dobrindt, K., Schwarzkopf, O.: On lazy randomized incremental construction. Discr. Comput. Geometry 14, 261\u2013286 (1995)","journal-title":"Discr. Comput. Geometry"},{"key":"20_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer Berlin Heidelberg, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2"},{"issue":"1\u20132","key":"20_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1142\/S0218195902000748","volume":"12","author":"TM Chan","year":"2002","unstructured":"Chan, T.M.: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. Int. J. Comput. Geom. Appl. 12(1\u20132), 67\u201385 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"20_CR10","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. 11, 463\u2013469 (1990)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discr. Comput. Geometry 9(2), 145\u2013158 (1993)","journal-title":"Discr. Comput. Geometry"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02573985","volume":"10","author":"B Chazelle","year":"1993","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discr. Comput. Geometry 10, 377\u2013409 (1993)","journal-title":"Discr. Comput. Geometry"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02573973","volume":"10","author":"B Chazelle","year":"1993","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: Diameter, width, closest line pair and parametric searching. Discr. Comput. Geometry 10, 183\u2013196 (1993)","journal-title":"Discr. Comput. Geometry"},{"issue":"2","key":"20_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0925-7721(94)90009-4","volume":"4","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Friedman, J.: Point location among hyperplanes and unidirectional ray-shooting. Comput. Geometry: Theor. Appl. 4(2), 53\u201362 (1994)","journal-title":"Comput. Geometry: Theor. Appl."},{"key":"20_CR15","unstructured":"Chung, C., Ahn, T., Bae, S.W., Ahn, H.K.: Parallel line centers with guaranteed separation. In: Proceedings of the 35th Canadian Conference on Computational Geometry (CCCG 2023), pp. 153\u2013160 (2023)"},{"key":"20_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105468","volume":"138","author":"RL Church","year":"2022","unstructured":"Church, R.L., Drezner, Z.: Review of obnoxious facilities location problems. Comput. Oper. Res. 138, 105468 (2022)","journal-title":"Comput. Oper. Res."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2023.05.014","volume":"338","author":"AK Das","year":"2023","unstructured":"Das, A.K., Das, S., Mukherjee, J.: Approximation algorithms for orthogonal line centers. Discret. Appl. Math. 338, 69\u201376 (2023)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.ejor.2005.02.048","volume":"173","author":"JM D\u00edaz-B\u00e1\u00f1ez","year":"2006","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., L\u00f3pez, M.A., Sellar\u00e9s, J.A.: Locating an obnoxious plane. Eur. J. Oper. Res. 173(2), 556\u2013564 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0222031","volume":"22","author":"H Edelsbrunner","year":"1993","unstructured":"Edelsbrunner, H., Seidel, R., Sharir, M.: On the zone theorem for hyperplane arrangements. SIAM J. Comput. 22(2), 418\u2013429 (1993)","journal-title":"SIAM J. Comput."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Glozman, A., Kedem, K., Shpitalnik, G.: On some geometric selection and optimization problems via sorted matrices. Comput. Geom.: Theory Appl. 11(1), 17\u201328 (1998)","DOI":"10.1016\/S0925-7721(98)00017-0"},{"key":"20_CR21","unstructured":"Halperin, D., Sharir, M.: Arrangements. In: Goodman, J., O\u2019Rourke, J., T\u00f3th, C. (eds.) Handbook of Discrete and Computational Geometry, chap. 28, pp. 723\u2013762. CRC Press, 3rd edn. (2018)"},{"key":"20_CR22","unstructured":"Houle, M.E., Maciel, A.: Finding the widest empty corridor through a set of points. Snapshots of computational and discrete geometry, pp. 210\u2013213 (1988)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Houle, M., Toussaint, G.: Computing the width of a set. In: Proc. 1st ACM Sympos. Comput. Geom. (SoCG 1985), pp. 1\u20137 (1985)","DOI":"10.1145\/323233.323234"},{"issue":"2","key":"20_CR24","first-page":"231","volume":"1","author":"R Janardan","year":"1994","unstructured":"Janardan, R., Preparata, F.P.: Widest-corridor problems. Nordic J. Comput. 1(2), 231\u2013245 (1994)","journal-title":"Nordic J. Comput."},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J., Kowaluk, M.: The two-line center problem from a polar view: a new algorithm and data structure. In: Proc. 4th International Workshop Algorithmic Data Structure (WADS 1995). Lecture Notes Comput. Sci., vol. 955, pp. 13\u201325 (1995)","DOI":"10.1007\/3-540-60220-8_47"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discr. Comput. Geometry 10, 157\u2013182 (1993)","journal-title":"Discr. Comput. Geometry"},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02573975","volume":"10","author":"J Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J., Schwarzkopf, O.: On ray shooting in convex polytopes. Discr. Comput. Geometry 10, 215\u2013232 (1993)","journal-title":"Discr. Comput. Geometry"},{"issue":"5","key":"20_CR28","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0167-6377(82)90039-6","volume":"1","author":"N Megiddo","year":"1982","unstructured":"Megiddo, N., Tamir, A.: On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1(5), 194\u2013197 (1982)","journal-title":"Oper. Res. Lett."},{"key":"20_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer New York, New York, NY (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"issue":"1","key":"20_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00130-6","volume":"68","author":"CS Shin","year":"1998","unstructured":"Shin, C.S., Shin, S.Y., Chwa, K.Y.: The widest $$k$$-dense corridor problems. Inf. Process. Lett. 68(1), 25\u201331 (1998)","journal-title":"Inf. Process. Lett."},{"key":"20_CR31","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE MELECON (1983)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T21:30:53Z","timestamp":1731533453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}