On polygons enclosing point sets II
Visualitza/Obre
Cita com:
hdl:2117/9618
Tipus de documentArticle
Data publicació2009-08
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Let R and B be disjoint point sets such that $R\cup B$ is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements
in R belong to the interior of P.
In this paper we prove that if the vertices of the convex hull of $R\cup B$ belong to B, and
|R| ≤ |Conv(B)| − 1 then B encloses R. The bound is tight. This improves on results of a
previous paper in which it was proved that if |R| ≤ 56|Conv (B)| then B encloses R. To obtain our result we prove the next result which is interesting on its own right: Let P be a convex polygon with n vertices $\emph{p_1}$,...,$\emph{p_n}$ and S a set of m points contained in the interior of P, m ≤ n−1. Then there is a convex decomposition {$P_1$,...,$P_n$} of P such that all points from S
lie on the boundaries of $P_1$,...,$P_n$, and each $P_i$ contains a whole edge of P on its boundary.
CitacióHurtado, F. [et al.]. On polygons enclosing point sets II. "Graphs and combinatorics", Agost 2009, vol. 25, núm. 3, p. 327-339.
ISSN0911-0119
Versió de l'editorhttp://www.matem.unam.mx/~urrutia/online_papers/EncPointsREV.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
onpolygonsenclosing.pdf | 179,4Kb | Visualitza/Obre |