Now showing items 1-20 of 20

• #### A new 2D tessellation for angle problems: The polar diagram ﻿ [Article]

(2006)
The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but the Euclidean minimum distance criterion is replaced for the minimal angle criterion. The result is ...
• #### Anchura de un convexo en la esfera. ﻿ [Presentation]

(1997-01)
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias y suficientes para que un conjunto convexo sobre la superficie de la esfera puede pasar a través ...
• #### Author Correction: Scutoids are a geometrical solution to three-dimensional packing of epithelia ﻿ [Article]

(Nature Research, 2018)
• #### Compact Grid Representation of Graphs ﻿ [Chapter of Book]

(2011)
A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Additionally G is said to be properly ...
• #### Cover contact graphs ﻿ [Article]

(2012)
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We ...
• #### Cover Contact Graphs ﻿ [Article]

(2007)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homothetic triangles). ...
• #### Diagonal flips in outer-triangulations on closed surfaces ﻿ [Article]

(2002)
We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal flips, up to isotopy, if they have a sufficiently large and equal number of vertices.
• #### Diagonal flips in outer-triangulations on closed surfaces ﻿ [Article]

(2002)
We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal flips, up to isotopy, if they have a sufficiently large and equal number of vertices.
• #### El diagrama polar ﻿ [PhD Thesis]

(2002)
• #### Dilation-free graphs in the l1 metric ﻿ [Article]

(2007)
The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points in the graph is no longer than their planar distance. Metrically speaking, those graphs are equivalent ...
• #### Geometría computaciones en superficies no planas ﻿ [PhD Thesis]

(1998-09-28)
De forma general, la Geometría Computaciones trata del estudio de algoritmos que resuelven problemas geométricos con el ordenador. Esta joven disciplina, que nació de una colección de resultados diversos, constituye, debido ...
• #### K-Factores en nubes bicromáticas ﻿ [Presentation]

(2007)
Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar para asegurar la existencia de un k {factor. Dos tipos de puntos adicionales serán tratados: puntos ...
• #### Monochromatic geometric k-factors for bicolored point sets with auxiliary points ﻿ [Article]

(2014)
Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We consider the problem of finding such a k-factor of S by using auxiliary points. Two types are considered: ...
• #### Monochromatic geometric k-factors in red-blue sets with white and Steiner points ﻿ [Article]

(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum ...
• #### Puntos en posición general para una λ-distancia ﻿ [Presentation]

(Alberto Márquez, 2002)
• #### Reporting Bichromatic Segment Intersections from Point Sets ﻿ [Article]

(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red ...
• #### Scutoids are a geometrical solution to three-dimensional packing of epithelia ﻿ [Article]

(Nature Publishing Group, 2018)
As animals develop, tissue bending contributes to shape the organs into complex three-dimensional structures. However, the architecture and packing of curved epithelia remains largely unknown. Here we show by means of ...
• #### Stabbers of line segments in the plane ﻿ [Article]

(2011)
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges ...
• #### Transforming triangulations on non planar-surfaces ﻿ [Article]

(2003)
We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
• #### Transforming Triangulations on Nonplanar Surfaces ﻿ [Article]

(2010)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...