Buscar
Mostrando ítems 1-10 de 14
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
(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: ...
Artículo
Stabbers of line segments in the plane
(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 ...
Artículo
Cover Contact Graphs
(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). ...
Artículo
A new 2D tessellation for angle problems: The polar diagram
(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 ...
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(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 ...
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(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 ...
Artículo
Transforming Triangulations on Nonplanar Surfaces
(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 ...
Artículo
Diagonal flips in outer-triangulations on closed surfaces
(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.
Artículo
A quantitative principle to understand 3D cellular connectivity in epithelial tubes
(Cell Systems, 2022)
Apico-basal cell intercalations (scutoids) optimize packing and energy expenditure in curved epithelia. Further consequences of this new paradigm of tissue packing remain uncharacterized. In particular, how scutoids modify ...
Artículo
Cover contact graphs
(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 ...