Good Illumination of Minimum Range

Details Good Illumination of Minimum Range Good Illumination of Minimum Range

2006-06-02

arxiv.org/abs/cs/0606013v1

Computer Science

Computational Geometry

Scientific paper

A point p is 1-well illuminated by a set F of n point lights if p lies in the interior of the convex hull of F. This concept corresponds to triangle-guarding or well-covering. In this paper we consider the illumination range of the light sources as a parameter to be optimized. First, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate a given point p. We also compute a minimal set of light sources that 1-well illuminates p with minimum illumination range. Second, we solve the problem of minimizing the light sources' illumination range to 1-well illuminate all the points of a line segment with an O(n^2) algorithm. Finally, we give an O(n^2 log n) algorithm for preprocessing the data so that one can obtain the illumination range needed to 1-well illuminate a point of a line segment in O(log n) time. These results can be applied to solve problems of 1-well illuminating a trajectory by approaching it to a polygonal path.

Affiliated with

Also associated with

No associations

Rating

Good Illumination of Minimum Range 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 Good Illumination of Minimum Range, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Good Illumination of Minimum Range will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633405