| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415664 | Computational Geometry | 2013 | 18 Pages |
Abstract
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects P in the plane, so that for any arbitrary query point q, the largest circle that contains q but does not contain any member of P, can be reported efficiently. The geometric sets that we consider are point sets and boundaries of simple polygons.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
John Augustine, Sandip Das, Anil Maheshwari, Sabhas C. Nandy, Sasanka Roy, Swami Sarvattomananda,