Computer Science – Computational Geometry
Scientific paper
2007-02-16
Computer Science
Computational Geometry
Fixed incorrect affiliation
Scientific paper
The aperture angle alpha(x, Q) of a point x not in Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the plane with respect to an inscribed convex polygon Q of C is the minimum aperture angle of any x in C Q with respect to Q. We show that for any compact convex set C in the plane and any k > 2, there is an inscribed convex k-gon Q of C with aperture angle approximation error (1 - 2/(k+1)) pi. This bound is optimal, and settles a conjecture by Fekete from the early 1990s. The same proof technique can be used to prove a conjecture by Brass: If a polygon P admits no approximation by a sub-k-gon (the convex hull of k vertices of P) with Hausdorff distance sigma, but all subpolygons of P (the convex hull of some vertices of P) admit such an approximation, then P is a (k+1)-gon. This implies the following result: For any k > 2 and any convex polygon P of perimeter at most 1 there is a sub-k-gon Q of P such that the Hausdorff-distance of P and Q is at most 1/(k+1) * sin(pi/(k+1)).
Ahn Hee-Kap
Bae Sang Won
Cheong Otfried
Gudmundsson Joachim
No associations
LandOfFree
Aperture-Angle and Hausdorff-Approximation of Convex Figures 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 Aperture-Angle and Hausdorff-Approximation of Convex Figures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aperture-Angle and Hausdorff-Approximation of Convex Figures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-196294