Exploració per autor "Silveira, Rodrigo Ignacio"
Ara es mostren els items 28-47 de 76
-
Farthest color Voronoi diagrams: complexity and algorithms
Mantas, Ioannis; Papadopoulou, Evanthia; Sacristán Adinolfi, Vera; Silveira, Rodrigo Ignacio (Springer, 2021)
Text en actes de congrés
Accés restringit per política de l'editorialThe farthest-color Voronoi diagram (FCVD) is a farthestsite Voronoi structure defined on a family P of m point-clusters in the plane, where the total number of points is n. The FCVD finds applications in problems related ... -
Flips in higher order Delaunay triangulations
Arseneva, Elena; Bose, Prosenjit; Cano Vila, María del Pilar; Silveira, Rodrigo Ignacio (2021)
Text en actes de congrés
Accés restringit per política de l'editorialWe study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph ... -
Flow computations on imprecise terrains
Driemel, Anne; Haverkort, Herman; Löffler, Maarten; Silveira, Rodrigo Ignacio (Springer Verlag, 2011)
Text en actes de congrés
Accés restringit per acord de confidencialitatWe study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and ... -
Flow computations on imprecise terrains
Driemel, Anne; Haverkort, Herman; Löffler, Maarten; Silveira, Rodrigo Ignacio (2013)
Article
Accés obertWe study water flow computation on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and ... -
Geomasking through perturbation, or counting points in circles
Löffler, Maarten; Luo, Jun; Silveira, Rodrigo Ignacio (2017)
Text en actes de congrés
Accés restringit per política de l'editorialMotivated by a technique in privacy protection, in which n points are randomly perturbed by at most a distance r, we study the following problem: Given n points and m circles in the plane, what is the maximum r such that ... -
GEOMETRIA DISCRETA I ALGORÍTMICA | FINAL
Silveira, Rodrigo Ignacio; Huemer, Clemens; Pfeifle, Julián (Universitat Politècnica de Catalunya, 2023-12-19)
Examen
Accés restringit a la comunitat UPC -
Geometric biplane graphs I: maximal graphs
Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
Text en actes de congrés
Accés obert -
Geometric biplane graphs I: maximal graphs
Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
Article
Accés obertWe study biplane graphs drawn on a finite planar point set in general position. This is the family of geometric graphs whose vertex set is and can be decomposed into two plane graphs. We show that two maximal biplane ... -
Geometric biplane graphs II: graph augmentation
Garcia Olaverri, Alfredo Martin; Hurtado Díaz, Fernando Alfredo; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2015-03-01)
Article
Accés obertWe study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every ... -
Geometric Biplane Graphs II: Graph Augmentation
Hurtado Díaz, Fernando Alfredo; Garcia Olaverri, Alfredo Martin; Korman Cozzetti, Matías; Matos, Inés P.; Saumell, Maria; Silveira, Rodrigo Ignacio; Tejel Altarriba, Francisco Javier; Tóth, Csaba D. (2013)
Text en actes de congrés
Accés obertWe study biplane graphs drawn on a nite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every ... -
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 ...