• 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
      Accés restringit per política de l'editorial
      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
      Accés obert
      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)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      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 ...