• Median trajectories 

      Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio; Wenk, Carola; Wiratma, Lionov (2012-05)
      Article
      Accés obert
      We investigate the concept of a median among a set of trajectories. We establish criteria that a “median trajectory” should meet, and present two different methods to construct a median for a set of input trajectories. The ...
    • Processing aggregated data : the location of clusters in health data 

      Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio (2012-07)
      Article
      Accés restringit per política de l'editorial
      Spatially aggregated data is frequently used in geographical applications. Often spatial data analysis on aggregated data is performed in the same way as on exact data, which ignores the fact that we do not know the actual ...
    • Region-based approximation algorithms for visibility between imprecise locations 

      Buchin, Kevin; Kostitsyna, Irina; Löffler, Maarten; Silveira, Rodrigo Ignacio (2015)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      In this paper we present new geometric algorithms for approximating the visibility between two imprecise locations amidst a set of obstacles, where the imprecise locations are modeled by continuous probability distributions. ...
    • Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) 

      Buchin, Kevin; Kostitsyna, Irina; Löffler, Maarten; Silveira, Rodrigo Ignacio (2014)
      Text en actes de congrés
      Accés obert
      Let p and q be two imprecise points, given as prob- ability density functions on R 2 , and let R be a set of n line segments in R 2 . We study the problem of approximating the probability that p and q can see each other; ...
    • Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) 

      Buchin, Kevin; Kostitsyna, Irina; Löffler, Maarten; Silveira, Rodrigo Ignacio (2019-07)
      Article
      Accés obert
      Let p and q be two imprecise points, given as probability density functions on R2 , and let O be a set of disjoint polygonal obstacles in R2 . We study the problem of approximating the probability that p and q can see each ...