Exploració per autor "Silveira, Rodrigo Ignacio"
Ara es mostren els items 38-57 de 76
-
Hamiltonicity for convex shape Delaunay and Gabriel Graphs
Bose, Prosenjit; Cano Vila, María del Pilar; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (Springer, 2019)
Text en actes de congrés
Accés restringit per política de l'editorialWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape C. Let S be a point set in the plane. ... -
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Bose, Prosenjit; Cano Vila, María del Pilar; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2020-08)
Article
Accés obertWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape \(\mathcal {C}\) . Let S be a point ... -
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Bose, Prosenjit; Cano Vila, María del Pilar; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2019)
Text en actes de congrés
Accés restringit per política de l'editorialWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Let S be a point set in the plane. The k-order Delaunay graph of S, denoted k-DGC(S), has vertex set S and edge pq provided ... -
III Jornada Docent del Departament de Matemàtiques
Pascual Gainza, Pere; Silveira, Rodrigo Ignacio; Trias Pairó, Juan; Rallo Capdevila, Miguel; Susín Sánchez, Antonio (2018-06-25)
Audiovisual
Accés obertPresentació El Departament de Matemàtiques de la UPC organitza anualment una jornada docent en l’àmbit de les matemàtiques. Aquest any és la terecra edició Destinataris Professorat de la UPC i d’altres universitats, ... -
Implementing data-dependent triangulations with higher order Delaunay triangulations
Rodríguez, Natalia; Silveira, Rodrigo Ignacio (Association for Computing Machinery (ACM), 2016)
Text en actes de congrés
Accés restringit per política de l'editorialThe Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ... -
Implementing data-dependent triangulations with higher order delaunay triangulations
Rodríguez, Natalia; Silveira, Rodrigo Ignacio (Multidisciplinary Digital Publishing Institute (MDPI), 2017-12-01)
Article
Accés restringit per política de l'editorialThe Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ... -
Improving shortest paths in the Delaunay triangulation
Abellanas, Manuel; Claverol Aguas, Mercè; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2012)
Article
Accés obertWe study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to ... -
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 ...