Now showing items 1-4 of 4

    • Shortest paths in portalgons 

      Löffler, M.; Silveira, Rodrigo Ignacio; Staals, Frank (2021)
      Conference report
      Restricted access - publisher's policy
    • Terrain prickliness: theoretical grounds for high complexity viewsheds 

      Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (2021)
      Conference report
      Open Access
      An important task when working with terrain models is computing viewsheds: the parts of the terrain visible from a given viewpoint. When the terrain is modeled as a polyhedral terrain, the viewshed is composed of the union ...
    • Terrain prickliness: theoretical grounds for low complexity viewsheds 

      Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank; Tiwary, Hans Raj (2021)
      Conference report
      Restricted access - publisher's policy
    • Terrain visibility with multiple viewpoints 

      Hurtado Díaz, Fernando Alfredo; Löffler, Maarten; Matos, Inés P.; Sacristán Adinolfi, Vera; Saumell, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (Springer, 2013)
      Conference report
      Open Access
      We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility ...