Buscar
Mostrando ítems 1-10 de 26
Artículo
The seven-triangle longest-side partition of triangles and mesh quality improvement
(Elsevier, 2008)
A new triangle partition, the seven-triangle longest-edge partition, based on the trisection of the edges is presented and the associated mesh quality improvement property, discussed. The seven-triangle longest-edge ...
Artículo
Single bend wiring on surfaces
(2002)
The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible orthogonal paths joining them, whether is it possible to choose a path for each pair avoiding all ...
Artículo
Locally grid graphs: classification and Tutte uniqueness
(2003)
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞, the canonical examples being the toroidal grids Cp×Cq. The paper contains two main results. First, we give a complete ...
Artículo
Resultados recientes sobre mosaicos de Penrose
(Real Sociedad Matemática Española, 2003)
Artículo
The Size of a Graph Without Topological Complete Subgraphs
(2000)
In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n not containing a subgraph homeomorphic to the complete graph of order p. Further, for ${\left \lceil ...
Artículo
Tutte uniqueness of locally grid graphs
(Departamento de Matemáticas CINVESTAV, 2004)
A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the research initiated in [4] and [3] we prove that most locally grid graphs are uniquely determined by ...
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
Artículo