Exploració per autor "Korman, Matias"

Ara es mostren els items 1-6 de 6

    • Balanced partitions of 3-colored geometric sets in the plane 

      Bereg, Sergey; Hurtado Díaz, Fernando Alfredo; Kano, Mikio; Korman, Matias; Lara, Dolores; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio; Urrutia Galicia, Jorge; Verbeek, Kevin (2015)
      Article
      Accés obert
      Let SS be a finite set of geometric objects partitioned into classes or colors . A subset S'¿SS'¿S is said to be balanced if S'S' contains the same amount of elements of SS from each of the colors. We study several ...

    • Colored spanning graphs for set visualization 

      Hurtado Díaz, Fernando Alfredo; Korman, Matias; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Shioura, Akiyoshi; Silveira, Rodrigo Ignacio; Speckmann, Bettina; Tokuyama, Takeshi (2018-03)
      Article
      Accés obert
      We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ...

    • On the complexity of barrier resilience for fat regions and bounded ply 

      Korman, Matias; Löffler, Maarten; Silveira, Rodrigo Ignacio; Strash, Darren (2018-06)
      Article
      Accés obert
      In the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so ...

    • Some properties of higher order delaunay and gabriel graphs 

      Bose, Prosenjit; Collette, Sébastien; Hurtado Díaz, Fernando Alfredo; Korman, Matias; Langerman, Stefan; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
      Text en actes de congrés
      Accés obert
      We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ...

    • Stabbing segments with rectilinear objects 

      Claverol Aguas, Mercè; Garijo, Delia; Korman, Matias; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2015-08-17)
      Capítol de llibre
      Accés restringit per política de l'editorial
      We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the plane that contain exactly one endpoint of each segment of S. Concretely, we provide efficient algorithms for reporting all ...

    • Stabbing segments with rectilinear objects 

      Claverol Aguas, Mercè; Garijo Royo, Delia; Korman, Matias; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2017-09-15)
      Article
      Accés obert
      Given a set S of n line segments in the plane, we say that a region R¿R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for ...