• 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 ...