{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:05Z","timestamp":1725525365640},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_8","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"83-92","source":"Crossref","is-referenced-by-count":0,"title":["Improved Algorithm for a Widest 1-Corner Corridor"],"prefix":"10.1007","author":[{"given":"Gautam K.","family":"Das","sequence":"first","affiliation":[]},{"given":"Debapriyay","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(96)00070-1","volume":"58","author":"S.-W. Chen","year":"1996","unstructured":"Chen, S.-W.: Widest empty L-shaped corridor. Information Processing Letters\u00a058, 277\u2013283 (1996)","journal-title":"Information Processing Letters"},{"key":"8_CR2","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.P.: The k-dense corridor problem. Pattern Recognition Letters\u00a011, 463\u2013469 (1990)","journal-title":"Pattern Recognition Letters"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.cor.2004.09.006","volume":"33","author":"J.M. Diaz-Banez","year":"2006","unstructured":"Diaz-Banez, J.M., Hurtado, F.: Computing obnoxious 1-corner polygonal chains. Computers and Operations Research\u00a033, 1117\u20131128 (2006)","journal-title":"Computers and Operations Research"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2006.02.002","volume":"98","author":"J.M. Diaz-Banez","year":"2006","unstructured":"Diaz-Banez, J.M., Lopez, M.A., Sellares, J.A.: On finding a widest empty 1-corner corridor. Information Processing Letters\u00a098, 199\u2013205 (2006)","journal-title":"Information Processing Letters"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.comgeo.2004.02.001","volume":"29","author":"P.P. Goswami","year":"2004","unstructured":"Goswami, P.P., Das, S., Nandy, S.C.: Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Computational Geometry Theory and Applications\u00a029, 163\u2013175 (2004)","journal-title":"Computational Geometry Theory and Applications"},{"key":"8_CR6","unstructured":"Houle, M.E., Maciel, A.: Finding the widest empty corridor through a set of points. In: Toussaint, G. (ed.) Snapshots of Computational and Discrete Geometry, Technical Report SOCS-88.11, School of Computer Science, McGill University (1988)"},{"key":"8_CR7","first-page":"231","volume":"1","author":"R. Janardan","year":"1994","unstructured":"Janardan, R., Preparata, F.P.: Widest-corridor problem. Nordic J. Computing\u00a01, 231\u2013245 (1994)","journal-title":"Nordic J. Computing"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D.T. Lee","year":"1985","unstructured":"Lee, D.T., Ching, Y.T.: The Power of Geometric Duality Revisited. Information Processing Letter\u00a021, 117\u2013122 (1985)","journal-title":"Information Processing Letter"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0304-3975(00)00370-4","volume":"255","author":"S.C. Nandy","year":"2001","unstructured":"Nandy, S.C., Harayama, T., Asano, T.: Dynamically maintaining the widest k-dense corridor. Theoretical Computer Science\u00a0255, 627\u2013639 (2001)","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00130-6","volume":"68","author":"C.-S. Shin","year":"1998","unstructured":"Shin, C.-S., Shin, S.Y., Chwa, K.-Y.: The widest k-dense corridor problem. Information Processing Letters\u00a068, 25\u201331 (1998)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:49:57Z","timestamp":1551772197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}