Now showing items 1-4 of 4

    • Capturing points with a rotating polygon (and a 3D extension) 

      Alegría Galicia, Carlos; Orden, David; Palios, Leonidas; Seara Ojea, Carlos; Urrutia Galicia, Jorge (2019-04)
      Article
      Open Access
      We study the problem of rotating a simple polygon to contain the maximum number of elements from a given point set in the plane. We consider variations of this problem where the rotation center is a given point or lies on ...
    • Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations 

      Alegría Galicia, Carlos; Orden Martin, David; Seara Ojea, Carlos; Urrutia Galicia, Jorge (Springer Nature, 2021-03)
      Article
      Open Access
      Let P be a set of n points in the plane. We compute the value of ¿¿[0,2p) for which the rectilinear convex hull of P, denoted by RHP(¿), has minimum (or maximum) area in optimal O(nlogn) time and O(n) space, improving the ...
    • On the Oß-hull of a planar point set 

      Alegría Galicia, Carlos; Orden, David; Seara Ojea, Carlos; Urrutia Galicia, Jorge (2018-03-01)
      Article
      Open Access
      We study the Oß-hull of a planar point set, a generalization of the Orthogonal Convex Hull where the coordinate axes form an angle ß. Given a set P of n points in the plane, we show how to maintain the Oß-hull of P while ...
    • Separating bichromatic point sets in the plane by restricted orientation convex hulls 

      Alegría Galicia, Carlos; Orden Martin, David; Seara Ojea, Carlos; Urrutia Galicia, Jorge (2022-10-10)
      Article
      Open Access
      We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let ...