Now showing items 1-6 of 6

    • 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
      Open Access
      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 ...
    • Colored spanning graphs for set visualization 

      Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio; Speckmann, Bettina (Springer, 2013)
      Conference report
      Open Access
      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 ...
    • Connect the dot: computing feed-links for network extension 

      Speckmann, Bettina; Silveira, Rodrigo Ignacio; Aronov, Boris; Buchin, Kevin; Buchin, Maike; Jansen, Bart; De Jong, Tom; Kreveld, Marc van; Loffler, Maarten; Luo, Jun (2011-12-20)
      Article
      Open Access
      Road network analysis can require distance from points that are not on the network themselves. We study the algorithmic problem of connecting a point inside a face (region) of the road network to its boundary while ...
    • Maximizing maximal angles for plane straight-line graphs 

      Aichholzer, Oswin; Hackl, Thomas; Hoffmann, Michael; Huemer, Clemens; Pór, Attila; Santos, Francisco; Speckmann, Bettina; Vogtenhuber, Birgit (2013-01)
      Article
      Restricted access - publisher's policy
      Let G=(S,E) be a plane straight-line graph on a finite point set S⊂R2 in general position. The incident angles of a point p∈S in G are the angles between any two edges of G that appear consecutively in the circular order ...
    • Non-crossing paths with geographic constraints 

      Silveira, Rodrigo Ignacio; Speckmann, Bettina; Verbeek, Kevin (Chapman & Hall/CRC, 2019-01-01)
      Article
      Open Access
      A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic ...
    • Non-crossing paths with geographic constraints 

      Silveira, Rodrigo Ignacio; Speckmann, Bettina; Verbeek, Kevin (Springer, 2018)
      Conference report
      Restricted access - publisher's policy
      A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic ...