Blocking the k-holes of point sets in the plane

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/85425

Title:	Blocking the k-holes of point sets in the plane
Author:	Cano, Javier; Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Shakai, Toshinori; Tejel Altarriba, Francisco Javier; Urrutia Galicia, Jorge
Other authors:	Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
Abstract:	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
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional -Computational geometry -k-holes -Piercing -Blocking -Geometria computacional
Rights:
Document type:	Article - Submitted version Article
Share: