| z (2007) | |||||||||||||||
Abstract | |||||||||||||||
| We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex vertices in a simple polygonization of S. We prove various combinatorial bounds and provide efficient algorithms to compute reflexivity, both exactly (in special cases) and approximately (in general). Our study naturally takes us into the examination of some closely related quantities, such as the convex cover number 1 (S) of a planar point set, which is the smallest number of convex chains that cover S, and the convex partition number 2 (S), which is given by the smallest number of disjoint convex chains that cover S. We prove that it is NPcomplete to determine the convex cover or the convex partition number, and we give logarithmic-approximation algorithms for determining each. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||