Now showing items 1-2 of 2

  • On polygons enclosing point sets II 

    Hurtado Díaz, Fernando Alfredo; Merino, C.; Oliveros, D.; Sakai, T.; Urrutia, J.; Ventura, Inmaculada (2009-08)
    Article
    Open Access
    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 ...
  • Two-convex polygons 

    Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J. (Université Libre de Bruxelles, 2009)
    Conference report
    Open Access
    We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.