Localized Geometric Query Problems

Details Localized Geometric Query Problems Localized Geometric Query Problems

2011-11-12

arxiv.org/abs/1111.2918v1

Computer Science

Computational Geometry

23 Pages, 6 Figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Localized Geometric Query Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Localized Geometric Query Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Localized Geometric Query Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-3099