Localized Geometric Query Problems
Computational Geometry
2015-03-19 v2
Abstract
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects in the plane, so that for any arbitrary query point , the largest circle that contains but does not contain any member of , can be reported efficiently. The geometric sets that we consider are point sets and boundaries of simple polygons.
Cite
@article{arxiv.1111.2918,
title = {Localized Geometric Query Problems},
author = {John Augustine and Sandip Das and Anil Maheshwari and Subhas C. Nandy and Sasanka Roy and Swami Sarvattomananda},
journal= {arXiv preprint arXiv:1111.2918},
year = {2015}
}