{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:59:20Z","timestamp":1725861560550},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_36","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"443-454","source":"Crossref","is-referenced-by-count":1,"title":["Computing a Minimum-Width Square or Rectangular Annulus with Outliers"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"36_CR1","unstructured":"Abellanas, M., Hurtado, F., Icking, C., Ma, L., Palop, B., Ramos, P.: Best fitting rectangles. In: Proceedings of the European Workshop on Computational Geometry (EuroCG 2003) (2003)"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding $$k$$ points with minimum diameter and related problems. J. Algorithms 12, 38\u201356 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"36_CR3","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.comgeo.2010.10.002","volume":"44","author":"HK Ahn","year":"2011","unstructured":"Ahn, H.K., Bae, S.W., Demaine, E.D., Demaine, M.L., Kim, S.S., Korman, M., Reinbacher, I., Son, W.: Covering points by disjoint boxes with outliers. Comput. Geom. Theor. Appl. 44(3), 178\u2013190 (2011)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"2","key":"36_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.jda.2008.12.002","volume":"7","author":"R Atanassov","year":"2009","unstructured":"Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. J. Discrete Alg. 7(2), 239\u2013248 (2009)","journal-title":"J. Discrete Alg."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Bae, S.W.: Computing a minimum-width square annulus in arbitrary orientation [extended abstract]. In: Proceedings of the 10th International Workshop on Algorithms and Computation (WALCOM 2016), vol. 9627, pp. 131\u2013142 (2016)","DOI":"10.1007\/978-3-319-30139-6_11"},{"key":"36_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computationsl Geometry: Alogorithms and Applications","author":"M Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computationsl Geometry: Alogorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"4","key":"36_CR7","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/PL00009478","volume":"22","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: Geometric applications of a randomized optimization technique. Discrete Comput. Geom. 22(4), 547\u2013567 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"36_CR8","unstructured":"Chan, T.M.: Remarks on $$k$$ -level algorithms in the plane (1999). Manuscript"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"TK Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds on planar $$k$$ -sets and related problems. Discrete Comput. Geom. 19, 373\u2013382 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"36_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1142\/S0218195996000186","volume":"6","author":"H Everett","year":"1996","unstructured":"Everett, H., Robert, J.M., van Kreveld, M.: An optimal algorithm for computing $$(\\le k)$$ -levels, with applications. Int. J. Comput. Geom. Appl. 6(3), 247\u2013261 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"36_CR11","doi-asserted-by":"crossref","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":"36_CR12","doi-asserted-by":"crossref","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, 169\u2013174 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"36_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14, 365\u2013384 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2012.02.041","volume":"508","author":"J Mukherjee","year":"2013","unstructured":"Mukherjee, J., Mahapatra, P., Karmakar, A., Das, S.: Minimum-width rectangular annulus. Theor. Comput. Sci. 508, 74\u201380 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0020-0190(97)00212-3","volume":"65","author":"M Segal","year":"1998","unstructured":"Segal, M., Kedem, K.: Enclosing $$k$$ points in the smallest axis parallel rectangle. Inform. Process. Lett. 65, 95\u201399 (1998)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:44:18Z","timestamp":1498315458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}