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.

Additional Metadata
Keywords Computational geometry, Largest empty disk, Medial axis, Query answering
Persistent URL dx.doi.org/10.1016/j.comgeo.2012.09.009
Journal Computational Geometry
Citation
Augustine, J. (John), Das, S. (Sandip), Maheshwari, A, Nandy, S.C. (Sabhas C.), Roy, S. (Sasanka), & Sarvattomananda, S. (Swami). (2013). Localized geometric query problems. Computational Geometry, 46(3), 340–357. doi:10.1016/j.comgeo.2012.09.009