A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
[chapter]

2001
*
Lecture Notes in Computer Science
*

The problem Minimum Convex Cover of covering a given polygon with a minimum number of (possibly overlapping) convex polygons is known to be NP -hard, even for polygons without holes [3] . We propose a polynomial-time approximation algorithm for this problem for polygons with or without holes that achieves an approximation ratio of O(log n), where n is the number of vertices in the input polygon. To obtain this result, we first show that an optimum solution of a restricted version of this

doi:10.1007/3-540-44676-1_28
fatcat:4ilrtahjfzck3cj4ax4irniuui