Querying for the Largest Empty Geometric Object in a Desired Location

Details Querying for the Largest Empty Geometric Object in a Desired Location Querying for the Largest Empty Geometric Object in a Desired Location

2010-04-05

arxiv.org/abs/1004.0558v2

Computer Science

Computational Geometry

This version is a significant update of our earlier submission arXiv:1004.0558v1. Apart from new variants studied in Sections

Scientific paper

We study new types of geometric query problems defined as follows: given a geometric set $P$, preprocess it such that given a query point $q$, the location of the largest circle that does not contain any member of $P$, but contains $q$ can be reported efficiently. The geometric sets we consider for $P$ are boundaries of convex and simple polygons, and point sets. While we primarily focus on circles as the desired shape, we also briefly discuss empty rectangles in the context of point sets.

Affiliated with

Also associated with

No associations

Rating

Querying for the Largest Empty Geometric Object in a Desired Location 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 Querying for the Largest Empty Geometric Object in a Desired Location, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Querying for the Largest Empty Geometric Object in a Desired Location will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-636778