Let P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its convex hull. A set B of points in the plane blocks the k-holes of P if any k-hole of P contains at least one element of B in the interior of its convex hull. In this paper we establish upper and lower bounds on the sizes of k-hole blocking sets, with emphasis in the case k=5.
CITATION STYLE
Cano, J., García, A., Hurtado, F., Sakai, T., Tejel, J., & Urrutia, J. (2015). Blocking the k-Holes of Point Sets in the Plane. Graphs and Combinatorics, 31(5), 1271–1287. https://doi.org/10.1007/s00373-014-1488-z
Mendeley helps you to discover research relevant for your work.