Buscar
Mostrando ítems 51-60 de 65
Artículo
Hexagonal Tilings: Tutte Uniqueness
(Cornell University, 2005)
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.
Artículo
Steiner distance and convexity in graphs
(2008)
We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. For this graph class, we prove that any Steiner tree of a vertex set is ...
Artículo
Local refinement based on the 7-triangle longest-edge partition
(2009)
The triangle longest-edge bisection constitutes an efficient scheme for refining a mesh by reducing the obtuse triangles, since the largest interior angles are subdivided. In this paper we specifically introduce a new local ...
Artículo
On the Graphs which are the Edge of a Plane Tiling
(Mathematica Scandinavica, 1995)
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
Separability of Point Sets by k-Level Linear Classification Trees
(2012)
Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level binary space partition (BSP) tree to classify/separate R and B, such that the tree defines a linear ...
Artículo
Euclidean position in Euclidean 2-orbifolds
(2004)
Intuitively, a set of sites on a surface is in Euclidean position if points are so close to each other that planar algorithms can be easily adapted in order to solve most of the classical problems in Computational Geometry. ...
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 ...
Artículo
Triangle-Free Planar Graphs as Segment Intersection Graphs
(2002)
We prove that every triangle-free planar graph is the intersection graph of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and oblique) and in such a ...
Artículo
Dilation-free graphs in the l1 metric
(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 ...