Being Fat and Friendly is Not Enough

Details Being Fat and Friendly is Not Enough Being Fat and Friendly is Not Enough

2009-08-17

arxiv.org/abs/0908.2369v1

Computer Science

Computational Geometry

Scientific paper

We show that there is no $(1+\eps)$-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the available triangles are prespecified in advance. Since a constant factor approximation algorithm is known for this problem \cite{cv-iaags-07}, this settles the approximability of this problem. We also investigate some related problems, including cover by friendly fat shapes, and independent set of triangles in three dimensions.

Affiliated with

Also associated with

No associations

Rating

Being Fat and Friendly is Not Enough 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 Being Fat and Friendly is Not Enough, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Being Fat and Friendly is Not Enough will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-19721