{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:50Z","timestamp":1763468210183},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04n05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p> Let P be a set of n points in the plane. We present an efficient algorithm for preprocessing P, so that, for a given query point q, we can quickly report the largest disk that contains q but its interior is disjoint from P. The storage required by the data structure is O(n log n), the preprocessing cost is O(n log <jats:sup>2<\/jats:sup> n), and a query takes O( log <jats:sup>2<\/jats:sup> n) time. We also present an alternative solution with an improved query cost and with slightly worse storage and preprocessing requirements. <\/jats:p>","DOI":"10.1142\/s021819591360008x","type":"journal-article","created":{"date-parts":[[2014,7,9]],"date-time":"2014-07-09T03:05:28Z","timestamp":1404875128000},"page":"335-355","source":"Crossref","is-referenced-by-count":1,"title":["FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT"],"prefix":"10.1142","volume":"23","author":[{"given":"HAIM","family":"KAPLAN","sequence":"first","affiliation":[{"name":"School of Computer Science, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHA","family":"SHARIR","sequence":"additional","affiliation":[{"name":"School of Computer Science, Tel Aviv University, Tel Aviv, Israel"},{"name":"Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,7,8]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.09.009"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195900000036"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010078"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1145\/7531.24036"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90120-7"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187683"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80064-8"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187688"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(91)90012-4"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1145\/6138.6151"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819591360008X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:35:02Z","timestamp":1565181302000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819591360008X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":10,"journal-issue":{"issue":"04n05","published-online":{"date-parts":[[2014,7,8]]},"published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.1142\/S021819591360008X"],"URL":"https:\/\/doi.org\/10.1142\/s021819591360008x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}