Exploració per autor "Silveira, Rodrigo Ignacio"
Ara es mostren els items 45-64 de 76
-
Map construction algorithms: a local evaluation through hiking data
Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (2020-02-26)
Article
Accés obertWe study five existing map construction algorithms, designed and tested with urban vehicle data in mind, and apply them to hiking trajectories with different terrain characteristics. Our main goal is to better understand ... -
Map construction algorithms: an evaluation through hiking data
Duran, David; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Association for Computing Machinery (ACM), 2017)
Text en actes de congrés
Accés restringit per política de l'editorialWe study five existing map construction algorithms, designed and tested with urban vehicle data in mind, and apply them to hiking trajectories with different terrain characteristics. Our main goal is to better understand ... -
Matching points with diametral disks
Huemer, Clemens; Pérez-Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2017)
Text en actes de congrés
Accés obertWe consider matchings between a set R of red points and a set B of blue points with diametral disks. In other words, for each pair of matched points p ¿ R and q ¿ B, we consider the diametral disk defined by p and q. We ... -
Matching points with disks with a common intersection
Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2019-07-01)
Article
Accés obertWe consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that ... -
Median trajectories
Buchin, Kevin; Buchin, Maike; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio; Wenk, Carola; Wiratma, Lionov (2012-05)
Article
Accés obertWe 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 ... -
New production matrices for geometric graphs
Esteban Pascual, Guillermo; Huemer, Clemens; Silveira, Rodrigo Ignacio (Elsevier, 2022-01-15)
Article
Accés obertWe use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another, simple and ... -
New results on production matrices for geometric graphs
Esteban Pascual, Guillermo; Huemer, Clemens; Silveira, Rodrigo Ignacio (2018-07-01)
Article
Accés obertWe present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of such objects. For instance, a formula for the number of ... -
New results on stabbing segments with a polygon
Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (Springer, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialWe consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon P if at least one of its two endpoints is contained in P. A segment set S is stabbed by P ... -
New results on stabbing segments with a polygon
Díaz Bañez, José Miguel; Korman Cozzetti, Matías; Pérez Lantero, Pablo; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2015-01-01)
Article
Accés obertWe consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed ... -
Non-crossing paths with geographic constraints
Silveira, Rodrigo Ignacio; Speckmann, Bettina; Verbeek, Kevin (Chapman & Hall/CRC, 2019-01-01)
Article
Accés obertA 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'editorialA 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 ... -
On approximating shortest paths in weighted triangular tessellations
Bose, Prosenjit; Esteban Pascual, Guillermo; Orden Martin, David; Silveira, Rodrigo Ignacio (Springer, 2022)
Text en actes de congrés
Accés obertWe study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional ... -
On approximating shortest paths in weighted triangular tessellations
Bose, Prosenjit; Esteban Pascual, Guillermo; Orden Martin, David; Silveira, Rodrigo Ignacio (2023-05-01)
Article
Accés obertWe study the quality of weighted shortest paths when a continuous 2-dimensional space is discretized by a weighted triangular tessellation. In order to evaluate how well the tessellation approximates the 2-dimensional ... -
On the complexity of barrier resilience for fat regions and bounded ply
Korman, Matias; Löffler, Maarten; Silveira, Rodrigo Ignacio; Strash, Darren (2018-06)
Article
Accés obertIn the barrier resilience problem (introduced by Kumar et al., Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so ... -
On the number of higher order Delaunay triangulations
Dieter Wilhelm, Mitsche; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (Springer Verlag, 2010)
Text en actes de congrés
Accés restringit per política de l'editorialHigher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay ... -
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'editorialSpatially 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 ... -
Production matrices for geometric graphs
Huemer, Clemens; Pilz, Alexander; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2016)
Article
Accés obertWe present production matrices for non-crossing geometric graphs on point sets in convex position, which allow us to derive formulas for the numbers of such graphs. Several known identities for Catalan numbers, Ballot ... -
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'editorialIn 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 obertLet 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 obertLet 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 ...