{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:20:35Z","timestamp":1742977235785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_6","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"56-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum-Width Square Annulus Intersecting Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taehoon","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongmin","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mincheol","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1137\/S0097539794265724","volume":"26","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Sharir, M.: Computing envelopes in four dimensions with applications. SIAM J. Comput. 26(6), 1714\u20131732 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_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. Discrete Comput. Geom. 16(4), 317\u2013337 (1996)","journal-title":"Discrete Comput. Geom."},{"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. Algorithms 17(3), 292\u2013318 (1994)","journal-title":"J. Algorithms"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02246508","volume":"52","author":"BK Bhattacharya","year":"1994","unstructured":"Bhattacharya, B.K., Jadhav, S., Mukhopadhyay, A., Robert, J.M.: Optimal algorithms for some intersection radius problems. Computing 52(3), 269\u2013279 (1994)","journal-title":"Computing"},{"issue":"1\u20132","key":"6_CR5","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."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01182771","volume":"11","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica 11(2), 116\u2013132 (1994)","journal-title":"Algorithmica"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.comgeo.2010.11.004","volume":"44","author":"O Cheong","year":"2011","unstructured":"Cheong, O., Everett, H., Glisse, M., Gudmundsson, J., Hornus, S., Lazard, S., Lee, M., Na, H.-S.: Farthest-polygon voronoi diagrams. Comput. Geom. 44(4), 234\u2013247 (2011)","journal-title":"Comput. Geom."},{"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. Springer TELOS, Santa Clara (2008)"},{"doi-asserted-by":"crossref","unstructured":"Dey, S.K., Papadopoulou, E.: The $$L_\\infty (L_1)$$ farthest line-segment Voronoi diagram. In: Ninth International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2012, pp. 49\u201355 (2012)","key":"6_CR9","DOI":"10.1109\/ISVD.2012.27"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L.J., Sharir, M.: The upper envelope of piecewise linear functions: algorithms and applications. Discrete Comput. Geom. 4(4), 311\u2013336 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66\u2013104 (1990)","journal-title":"ACM Trans. Graph."},{"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."},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-52055-4"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4), 419\u2013433 (2010)","journal-title":"Comput. Geom."},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$\\mathbb{R}^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"6_CR16","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_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02187732","volume":"4","author":"J Pach","year":"1989","unstructured":"Pach, J., Sharir, M.: The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis. Discrete Comput. Geom. 4, 291\u2013309 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"6_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Commun. ACM 29(7), 669\u2013679 (1986)","journal-title":"Commun. ACM"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0925-7721(96)00009-0","volume":"8","author":"B Zhu","year":"1997","unstructured":"Zhu, B.: Computing the shortest watchtower of a polyhedral terrain in $$O(n\\log n)$$ time. Comput. Geom. 8(4), 181\u2013193 (1997)","journal-title":"Comput. Geom."}],"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-319-75172-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:39:40Z","timestamp":1710344380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 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":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}