Now showing items 1-4 of 4

    • IconCovering point sets with two disjoint disks or squares  [Article]

      Cabello, Sergio; Díaz Báñez, José Miguel; Seara Ojea, Carlos; Sellarés, J. Antoni; Urrutia, Jorge; Ventura Molina, Inmaculada (Elsevier, 2007)
      We study the following problem: Given a set of red points and a set of blue points on the plane, find two unit disks CR and CB with disjoint interiors such that the number of red points covered by CR plus the number of ...
    • IconFitting a two-joint orthogonal chain to a point set  [Article]

      Díaz Báñez, José Miguel; Amaro López, M. A.; Mora, M.; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2010)
      We study the problem of fitting a two-joint orthogonal polygonal chain to a set S of n points in the plane, where the objective function is to minimize the maximum orthogonal distance from S to the chain. We show that ...
    • IconOn finding widest empty curved corridors  [Article]

      Bereg, Sergey; Díaz Báñez, José Miguel; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2007)
      An α-siphon of width w is the locus of points in the plane that are at the same distance w from a 1-corner polygonal chain C such that α is the interior angle of C. Given a set P of n points in the plane and a fixed angle ...
    • IconThe class cover problem with boxes  [Article]

      Bereg, Sergey; Cabello, S.; Díaz Báñez, José Miguel; Pérez Lantero, Pablo; Seara Ojea, Carlos; Ventura Molina, Inmaculada (Elsevier, 2012)
      In this paper we study the following problem: Given sets R and B of r red and b blue points respectively in the plane, find a minimum-cardinality set H of axis-aligned rectangles (boxes) so that every point in B is covered ...