{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:37Z","timestamp":1760441857287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_6","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"69-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum-Width Empty Square and Rectangular Annulus"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Baral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priya Ranjan","family":"Sinha Mahapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"6_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Ma, L., Palop, B., Ramos, P.: Best fitting rectangles. In: Proceedings of European Workshop on Computational Geometry (EuroCG 2003) (2003)"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Comput. Surv. 30(4), 412\u2013458 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algo. 17(3), 292\u2013318 (1994)","journal-title":"J. Algo."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: Proceedings of the Third Annual Symposium on Computational Geometry (SoCG 1987), pp. 278\u2013290 (1987)","DOI":"10.1145\/41958.41988"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2016.11.010","volume":"718","author":"SW Bae","year":"2018","unstructured":"Bae, S.W.: Computing a minimum-width square annulus in arbitrary orientation. Theoret. Comput. Sci. 718, 2\u201313 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01762115","volume":"3","author":"B Chazelle","year":"1988","unstructured":"Chazelle, B.: An algorithm for segment-dragging and its implementation. Algorithmica 3(1), 205\u2013221 (1988)","journal-title":"Algorithmica"},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(96)00070-1","volume":"58","author":"SW Cheng","year":"1996","unstructured":"Cheng, S.W.: Widest empty L-shaped corridor. Inform. Proc. Lett. 58(6), 277\u2013283 (1996)","journal-title":"Inform. Proc. Lett."},{"key":"6_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, 3rd edn. Springer-Verlag TELOS, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2006.02.002","volume":"98","author":"J D\u00edz-B\u00e1\u00f1ez","year":"2006","unstructured":"D\u00edz-B\u00e1\u00f1ez, J., L\u00f3pez, M., Sellar\u00e8s, J.: On finding a widest empty 1-corner corridor. Inform. Proc. Lett. 98(5), 199\u2013205 (2006)","journal-title":"Inform. Proc. Lett."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1142\/S0218195903001207","volume":"13","author":"JM D\u00edz-B\u00e1\u00f1ez","year":"2003","unstructured":"D\u00edz-B\u00e1\u00f1ez, J.M., Hurtado, F., Meijer, H., Rappaport, D., Sellar\u00e8s, J.A.: The largest empty annulus problem. Int. J. Comput. Geom. Appl. 13(4), 317\u2013325 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"6_CR11","unstructured":"Ebara, H., Fukuyama, N., Nakano, H., Nakanishi, Y.: Roundness algorithms using the Voronoi diagrams. In: Abstract: 1st Canadian Conference on Computational Geometry (CCCG 1989), p. 41 (1989)"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.orl.2009.02.007","volume":"37","author":"ON Gluchshenko","year":"2009","unstructured":"Gluchshenko, O.N., Hamacher, H.W., Tamir, A.: An optimal $$O(n\\log n)$$ algorithm for finding an enclosing planar rectilinear annulus of minimum width. Oper. Res. Lett. 37(3), 168\u2013170 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of $$n$$ line segments in $$O(n log n)$$ time. Inform. Proc. Lett. 33(4), 169\u2013174 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"6_CR14","unstructured":"Houle, M., Maciel, A.: Finding the widest empty corridor through aset of points. In: Toussaint, G. (ed.) Snapshots of Computational and Discrete Geometry, pp. 201\u2013213, Department Computer Science, McGill University (1988)"},{"key":"6_CR15","first-page":"231","volume":"1","author":"R Janardan","year":"1994","unstructured":"Janardan, R., Preparata, F.P.: Widest-corridor problems. Nordic J. Comput. 1, 231\u2013245 (1994)","journal-title":"Nordic J. Comput."},{"key":"6_CR16","unstructured":"Mahapatra, P.R.S.: Largest empty axis-parallel rectangular annulus. J. Emerg. Trends Comput. Inf. Sci. 3(6) (2012)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.02.041","volume":"508","author":"J Mukherjee","year":"2013","unstructured":"Mukherjee, J., Mahapatra, P.R.S., Karmakar, A., Das, S.: Minimum-width rectangular annulus. Theoret. Comput. Sci. 508, 74\u201380 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1990","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0010-4485(92)90035-9","volume":"24","author":"U Roy","year":"1992","unstructured":"Roy, U., Zhang, X.: Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error. Comput. Aided Des. 24(3), 161\u2013168 (1992)","journal-title":"Comput. Aided Des."},{"issue":"5","key":"6_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01008046","volume":"12","author":"GT Toussaint","year":"1983","unstructured":"Toussaint, G.T.: Computing largest empty circles with location constraints. Int. J. Comput. Info. Sci. 12(5), 347\u2013358 (1983)","journal-title":"Int. J. Comput. Info. Sci."},{"key":"6_CR21","unstructured":"Toussaint, G.T.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE MELECON 1983, pp. 1\u20134 (1983)"},{"key":"6_CR22","unstructured":"Wainstein, A.D.: A non-monotonous placement problem in the plane. In: Abstract: 9th All-Union Symposium USSR Software Systems for Solving Optimal Planning Problems, pp. 70\u201371 (1986)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:36Z","timestamp":1709823036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"100","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":"30","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":"30% - 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","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":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}