Name
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(n log n), the preprocessing cost is O(n log(2) n), and a query takes O(log(2) n) time. We also present an alternative solution with an improved query cost and with slightly worse storage and preprocessing requirements. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1142/S021819591360008X | INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
DocType | Volume | Issue |
Journal | 23 | 4-5 |
ISSN | Citations | PageRank |
0218-1959 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haim Kaplan | 1 | 3581 | 263.96 |
| Micha Sharir | 2 | 8405 | 1183.84 |