局部化几何查询问题
Localized Geometric Query Problems
摘要:
研究了一类新的几何查询问题。我们需要对平面上的一组几何对象$P$进行预处理,以便对于任意查询点$q$,可以有效地报告包含$q$但不包含$P$的任何成员的最大圆。我们考虑的几何集合是简单多边形的点集和边界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。