Finding the maximal empty disk containing a query point

Haim Kaplan*, Micha Sharir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012
Pages287-292
Number of pages6
DOIs
StatePublished - 2012
Event28th Annual Symposuim on Computational Geometry, SCG 2012 - Chapel Hill, NC, United States
Duration: 17 Jun 201220 Jun 2012

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference28th Annual Symposuim on Computational Geometry, SCG 2012
Country/TerritoryUnited States
CityChapel Hill, NC
Period17/06/1220/06/12

Fingerprint

Dive into the research topics of 'Finding the maximal empty disk containing a query point'. Together they form a unique fingerprint.

Cite this