{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T03:40:03Z","timestamp":1737603603333,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540435945"},{"type":"electronic","value":"9783540477891"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47789-6_5","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T18:56:19Z","timestamp":1196448979000},"page":"46-54","source":"Crossref","is-referenced-by-count":4,"title":["The Largest Empty Annulus Problem"],"prefix":"10.1007","author":[{"given":"J. M.","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Rappaport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Sellares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"5_CR1","unstructured":"P.K. Agarwal AND M. Sharir, Daventport-Schinzel sequences and their geometric applications. In Sacks and J. Urrutia, editors, \u201cHandbook of Computational geometry\u201d, chapter 1, North Holland, 1999."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"P.K. Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M. AND Toledo S., Applications of parametric searching in geometric optimization. Journal of Algorithms, 17, 1994, 292\u2013318.","journal-title":"Journal of Algorithms"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F. AND Schwarzkopf O., A simple randomized incremental algorithm for computing higher order Voronoi diagrams. In Proc. 7th Annu. Sympos. Comput. Geom., 1995, 142\u2013151.","DOI":"10.1145\/109648.109664"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/opre.36.1.84","volume":"36","author":"R. Batta","year":"1988","unstructured":"Batta, R. AND Chiu, S., Optimal obnoxious paths on a network: Transportation of hazardous materials. Opns. Res., 36, 1988, 84\u201392.","journal-title":"Opns. Res."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B. K. Circular Separability of Planar Point Sets. Computational Morphology, G. T. Toussaint ed. North Holland, 1988.","DOI":"10.1016\/B978-0-444-70467-2.50008-4"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Boffey, B. AND Karkazis, J., Optimal location of routes for vehicles: Transporting hazardous materials. European J. Oper. Res., 1995, 201\u2013215.","DOI":"10.1016\/0377-2217(94)00099-X"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0167-8655(90)90080-L","volume":"11","author":"S. Chattopadhyay","year":"1990","unstructured":"S. Chattopadhyay and P. Das. The k-dense corridor problems. Pattern Recogn. Lett., 11:463\u2013469, 1990.","journal-title":"Pattern Recogn. Lett."},{"key":"5_CR8","unstructured":"S.-W. Cheng. Widest empty corridor with multiple links and right-angle turns. In Proc. 6th Canad. Conf. Comput. Geom., pages 57\u201362, 1994."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(96)00070-1","volume":"58","author":"S.-W. Cheng","year":"1996","unstructured":"S.-W. Cheng. Widest empty L-shaped corridor. Inform. Process. Lett. 58:277\u2013283, 1996.","journal-title":"Inform. Process. Lett."},{"key":"5_CR10","unstructured":"D{00cd}az-b{00c1}{00d1}ez J.M., Mesa J.A. AND Sch{00d6}bel A., Continuous Location of Dimensional Structures. Manuscript."},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1057\/jors.1989.174","volume":"40","author":"Z. Drezner","year":"1989","unstructured":"Drezner, Z. AND Wesolowsky, G.O., Location of an obnoxious route. Journal Operational Research Society, 40, 1989, 1011\u20131018.","journal-title":"Journal Operational Research Society"},{"key":"5_CR12","first-page":"620","volume":"J70-A","author":"H. Ebara","year":"1987","unstructured":"Ebara, H., Nakano, H., Nakanishi, Y. AND Sanada, T., A roundness algorithms using the Voronoi diagrams. Transactions IEICE, J70-A 1987, 620\u2013624.","journal-title":"Transactions IEICE"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Fish S., Separating point sets by circles and the recognition of digital disks. Pattern Analysis and Machine Intelligence, 8(4), 1986.","DOI":"10.1109\/TPAMI.1986.4767821"},{"key":"5_CR14","unstructured":"Follert, F. Maxmin location of an anchored ray in 3-space and related problems. In 7th Canadian Conference on Computational Geometry, Quebec, 1995."},{"key":"5_CR15","first-page":"389","volume-title":"Handbook of Discrete and Computational Geometry","author":"D. Halperin","year":"1997","unstructured":"Halperin, D., Handbook of Discrete and Computational Geometry. Jacob E. Goodman and Joseph O\u2019Rourke eds., CRC Press LLC, Boca Raton, FL, 389\u2013412, 1997."},{"key":"5_CR16","series-title":"Technical Report SOCS-88.11","first-page":"201","volume-title":"Snapshots of computational and discrete geometry","author":"M. Houle","year":"1988","unstructured":"M. Houle and A. Maciel. Finding the widest empty corridor through a set of points. In Snapshots of computational and discrete geometry, pages 201\u2013213. Dept. of Computer Science, McGill University, Montreal, Canada, 1988. Technical Report SOCS-88.11."},{"key":"5_CR17","unstructured":"R. Janardan and F. Preparata. Widest-corridor problems. In Proc. 5th Canad. Conf. Comput. Geom., pages 426\u2013431, 1993."},{"key":"5_CR18","first-page":"231","volume":"1","author":"R. Janardan","year":"1994","unstructured":"R. Janardan and F. P. Preparata. Widest-corridor problems. Nordic J. Comput., 1:231\u2013245, 1994.","journal-title":"Nordic J. Comput."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"478487","DOI":"10.1109\/TC.1982.1675946","volume":"C-31","author":"D. T. Lee","year":"1982","unstructured":"D. T. Lee. On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput., vol. C-31, pp. 478487, 1982.","journal-title":"IEEE Trans. Comput."},{"key":"5_CR20","unstructured":"O\u2019Rourke J., Computational Geometry in C. Cambridge University Press, 2nd edition, 1998."},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02187688","volume":"1","author":"J. ORourke","year":"1986","unstructured":"J. O\u2019Rourke, S.R. Kosaraju and N. Meggido, Computing circular separability. Discrete Computational Geometry, 1(1), 1986, 105\u2013113.","journal-title":"Discrete Computational Geometry"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02253130","volume":"21","author":"T. J. Rivlin","year":"1979","unstructured":"T. J. Rivlin, Approximation by circles. Computing, 21, 93\u2013104 1979","journal-title":"Computing"},{"key":"5_CR23","unstructured":"M. Sharir and P.K. Agarwal, \u201cDavenport-Schinzel sequences and their geometric applications\u201d, Cambridge University Press 1995."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01008046","volume":"12","author":"G. T. Toussaint","year":"1983","unstructured":"Toussaint G. T., Computing largest empty circles with location constraints. International Journal of Computer and Information Sciences, 12, 1983, 347\u2013358.","journal-title":"International Journal of Computer and Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47789-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T02:30:18Z","timestamp":1737599418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47789-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540435945","9783540477891"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-47789-6_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}