Localized geometric query problems |
| |
| Authors: | John Augustine Sandip Das Anil Maheshwari Sabhas C Nandy Sasanka Roy Swami Sarvattomananda |
| |
| Institution: | 1. Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India;2. Indian Statistical Institute, Kolkata, India;3. School of Computer Science, Carleton University, Ottawa, Canada;4. Chennai Mathematical Institute, Chennai, India;5. School of Mathematical Sciences, Ramakrishna Mission Vivekananda University, Belur, India |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
