Zobrazeno 1 - 10 of 27 pro vyhledávání: '"Silveira, Rodrigo Ignacio"'
1
Spanning ratio of shortest paths in weighted square tessellations
Autor: Bose, Prosenjit, Esteban Pascual, Guillermo, Orden Martin, David, Silveira, Rodrigo Ignacio
Continuous 2-dimensional space is often discretized by considering a grid of weighted square cells. In this work we study how well a weighted tessellation approximates the space, with respect to shortest paths. In particular, we consider a shortest p
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::5cf33d4ff025c6c77c1f8a5bd9b2b644
https://hdl.handle.net/2117/385087
Zobrazit plný text záznamu
4
Sequences of spanning trees for L-infinity Delaunay triangulations
Autor: Bose, Prosenjit, Cano Vila, María del Pilar, Silveira, Rodrigo Ignacio
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
We extend a known result about L2-Delaunay triangulations to L∞-Delaunay. Let TS be the set of all non-crossing spanning trees of a planar n-point set S. We prove that for each element T of TS, there exists a length-decreasing sequence of trees T0,
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::67cb00432e12c2437dbb408a12031e71
http://hdl.handle.net/2117/127570
Zobrazit plný text záznamu
5
Geomasking through perturbation, or counting points in circles
Autor: Löffler, Maarten, Luo, Jun, Silveira, Rodrigo Ignacio|||0000-0003-0202-4543
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Motivated 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 the number of points included
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5eb9cf7fc83446e39db50bf7152b7960
http://hdl.handle.net/2117/116561
Zobrazit plný text záznamu
6
Improving shortest paths in the Delaunay triangulation
Autor: 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
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
International journal of computational geometry and applications | XIV Spanish Meeting on Computacional Geometry | 27/06/2011-30/06/2011 | Alcalá de Henares, Madrid
Archivo Digital UPM
Universidad Politécnica de Madrid
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We 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 t, in the Delaunay triangulati
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::997f3e8c827ca071c84aa09467c40455
http://hdl.handle.net/2117/16981
Zobrazit plný text záznamu
7
A faster algorithm to compute the visibility map of a 1.5D terrain
Autor: Löffler, Maarten, Saumell, Maria, Silveira, Rodrigo Ignacio
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Given a 1.5D terrain, i.e., an x -monotone polygonal line in R 2 with n vertices, and 1 m n viewpoints placed on some of the terrain vertices, we study the problem of computing the parts of the terrain that are visible from at least one of the viewpo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ef45ea5e582389c014503af34fe59346
http://hdl.handle.net/2117/27275
Zobrazit plný text záznamu
8
Matching points with diametral disks
Autor: Huemer, Clemens, Pérez-Lantero, Pablo, Seara Ojea, Carlos, Silveira, Rodrigo Ignacio
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We 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 prove that for any R and B s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ec894088a951f621919115ce00b54743
http://hdl.handle.net/2117/113382
Zobrazit plný text záznamu
9
Evaluación experimental de métricas para comparar mapas
Autor: Marimon Llopis, Fernando
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Hoy en día hay muchas formas distintas de generar o modificar mapas automáticamente mediante datos GPS o gracias a las imágenes por satélite. El asunto es que dichos métodos necesitan alguna forma de evaluar la calidad de los mapas generados. Es
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::dfc445e69896dc4c87803d5eda9ded44
https://hdl.handle.net/2117/368689
Zobrazit plný text záznamu
10
Computing optimal shortcuts for networks
Autor: Donate Durán, Daniel
Estudiem augmentar una xarxa Euclidiana planar amb un segment, anomenat shortcut, per a minimitzar la major distància entre dos punts al llarg de les arestes de la xarxa resultant. Els problemes d'aquest tipus han rebut una atenció notable recentme
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______3484::5563892e4c8ba72b2bf0d4cf6f22ff7c
https://hdl.handle.net/2117/367980
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje