TY - GEN

T1 - Finding the maximal empty disk containing a query point

AU - Kaplan, Haim

AU - Sharir, Micha

PY - 2012

Y1 - 2012

N2 - 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(nlog n), the preprocessing cost is O(n log 2 n), and a query takes O(log 2 n) time.

AB - 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(nlog n), the preprocessing cost is O(n log 2 n), and a query takes O(log 2 n) time.

UR - http://www.scopus.com/inward/record.url?scp=84863944930&partnerID=8YFLogxK

U2 - 10.1145/2261250.2261292

DO - 10.1145/2261250.2261292

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84863944930

SN - 9781450312998

T3 - Proceedings of the Annual Symposium on Computational Geometry

SP - 287

EP - 292

BT - Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012

T2 - 28th Annual Symposuim on Computational Geometry, SCG 2012

Y2 - 17 June 2012 through 20 June 2012

ER -