Exploració per autor "Saumell Mendiola, Maria"
Ara es mostren els items 4-12 de 12
-
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 ... -
Matching points with things
Taslakian, Perouz; Seara Ojea, Carlos; Saumell Mendiola, Maria; Langerman, Stefan; Hurtado Díaz, Fernando Alfredo; Aloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila Monroy, Ruy; Hart, Vi (Springer Verlag, 2010)
Text en actes de congrés
Accés restringit per política de l'editorialGiven an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to ... -
Mesures de regularitat per a polígons convexos
Saumell Mendiola, Maria (Universitat Politècnica de Catalunya, 2008)
Projecte Final de Màster Oficial
Accés obertAl llarg d'aquesta memòria, hem plantejat possibles mesures de regularitat, totes elles justificades, per a un n-gon convex qualsevol que han donat lloc a problemes de geometria discreta i computacional. A més, hem estat ... -
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 ... -
Proximity graphs inside large weighted graphs
Ábrego, Bernardo M.; Fabila Monroy, Ruy; Fernández-Merchant, Silvia; Flores Peñaloza, David; Hurtado Díaz, Fernando Alfredo; Meijer, Henk; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
Text en actes de congrés
Accés obertGiven a large weighted graph G = (V;E) and a subset U of V , we de¯ne several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path ... -
Recoloring directed graphs
Felsner, Stefan; Huemer, Clemens; Saumell Mendiola, Maria (Prensas Universitarias de Zaragoza, 2009)
Text en actes de congrés
Accés obertLet G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings and ' are joined by a ... -
Some properties of higher order delaunay and gabriel graphs
Bose, Prosenjit; Collette, Sébastien; Hurtado Díaz, Fernando Alfredo; Korman, Matias; Langerman, Stefan; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria (2010)
Text en actes de congrés
Accés obertWe consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties ... -
Terrain prickliness: theoretical grounds for high complexity viewsheds
Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank (2021)
Text en actes de congrés
Accés obertAn important task when working with terrain models is computing viewsheds: the parts of the terrain visible from a given viewpoint. When the terrain is modeled as a polyhedral terrain, the viewshed is composed of the union ... -
Terrain prickliness: theoretical grounds for low complexity viewsheds
Acharyya, Ankush; Jallu, Ramesh; Löffler, M.; Meijer, Geert; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio; Staals, Frank; Tiwary, Hans Raj (2021)
Text en actes de congrés
Accés restringit per política de l'editorial