Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Covering islands in plane point sets

Autor
Fabila, R.; Huemer, C.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2012
Volum
7579
Pàgina inicial
220
Pàgina final
225
DOI
https://doi.org/10.1007/978-3-642-34191-5_21 Obrir en finestra nova
URL
http://link.springer.com/chapter/10.1007/978-3-642-34191-5_21 Obrir en finestra nova
Resum
Let S be a set of n points in general position in the plane. A k-island I of S is a subset of k points of S such that Conv(I)¿n¿S¿=¿I. We show that, for an arbitrary but fixed number k¿=¿2, the minimum number of k-islands among all sets S of n points is T(n 2). The following related counting problem is also studied: For l¿<¿k, an l-island covers a k-island if it is contained in the k-island. Let C k,l (S) be the minimum number of l-islands needed to cover all the k-islands of S and let C...
Paraules clau
Horton sets, Islands, Planar point sets
Grup de recerca
DCG - Discrete and Combinatorial Geometry

Participants