Exploració per autor "Hurtado Díaz, Fernando Alfredo"
Ara es mostren els items 41-60 de 67
-
Geometric biplane graphs I: maximal graphs
(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
(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
(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 ... -
Geometric tree graphs of points in convex position
(1997)
Article
Accés obertGiven a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and $T_2$ are adjacent ... -
Gerometria. Apunts
(Universitat Politècnica de Catalunya, 2008)
Apunts
Accés obert -
Graphs of non-crossing perfect matchings
(2001)
Article
Accés obertLet Pn be a set of n = 2m points that are the vertices of a convex polygon, and let Mm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line segments and do not cross, ... -
Improving shortest paths in the Delaunay triangulation
(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 ... -
Large bichromatic point sets admit empty monochromatic 4-gons
(2009)
Text en actes de congrés
Accés obertWe consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES(k) such that any set S of at least fES(k) points in general position in the plane has a subset of k points that ... -
Matching points with things
(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 ... -
Moving rectangles
(2010)
Text en actes de congrés
Accés obertConsider a set of n pairwise disjoint axis-parallel rectangles in the plane. We call this set the source rectangles S. The aim is to move S to a set of (pairwise disjoint) target rectangles T . A move consists in a ... -
Necklaces, convolutions, and X plus Y
(2014-06-01)
Article
Accés restringit per política de l'editorialWe give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the ℓ p ... -
On k-enclosing objects in a coloured point set
(2014)
Text en actes de congrés
Accés obertWe introduce the exact coloured k -enclosing object problem: given a set P of n points in R 2 , each of which has an associated colour in f 1 ;:::;t g , and a vec- tor c = ( c 1 ;:::;c t ), ... -
On polygons enclosing point sets II
(2009-08)
Article
Accés obertLet R and B be disjoint point sets such that $R\cup B$ is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P. In ... -
On some partitioning problems for two-colored point sets
(2009)
Text en actes de congrés
Accés obertLet S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 pairwise disjoint monochromatic triangles with vertices in S and empty of points of S. We further show ... -
On structural and graph theoretic properties of higher order Delaunay graphs
(2009-12)
Article
Accés obertGiven a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through ... -
Order types and cross-sections of line arrangements in R^3
(2014)
Text en actes de congrés
Accés restringit per política de l'editorialWe consider sets L = {l1,...., ln} of n labeled lines in general position in R3, and study the order types of point sets fp1; : : : ; png that stem from the intersections of the lines in L with (directed) planes II, not ... -
Proximity graphs inside large weighted graphs
(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 ... -
Some properties of higher order delaunay and gabriel graphs
(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 ... -
Stabbing simplices of point sets with k-flats
(Universidad de Sevilla, 2013)
Text en actes de congrés
Accés obertLet S be a set of n points inRdin general position.A set H of k-flats is called an mk-stabber of S if the relative interior of anym-simplex with vertices in S is intersected by at least one element of H. In thispaper we ... -
Terrain visibility with multiple viewpoints
(Springer, 2013)
Text en actes de congrés
Accés obertWe study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility ...
