How to Cover a Point Set with a V-Shape of Minimum Width

Details How to Cover a Point Set with a V-Shape of Minimum Width How to Cover a Point Set with a V-Shape of Minimum Width

2011-08-09

arxiv.org/abs/1108.2063v1

Computer Science

Computational Geometry

In Proceedings of the 12th International Symposium on Algorithms and Data Structures (WADS), p.61-72, August 2011, New York, N

Scientific paper

A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are mirror-symmetric with respect to the line xy. The width of a balanced V-shape is the width of the strips. We first present an O(n^2 log n) time algorithm to compute, given a set of n points P, a minimum-width balanced V-shape covering P. We then describe a PTAS for computing a (1+epsilon)-approximation of this V-shape in time O((n/epsilon)log n+(n/epsilon^(3/2))log^2(1/epsilon)). A much simpler constant-factor approximation algorithm is also described.

Affiliated with

Also associated with

No associations

Rating

How to Cover a Point Set with a V-Shape of Minimum Width 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 How to Cover a Point Set with a V-Shape of Minimum Width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to Cover a Point Set with a V-Shape of Minimum Width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664336