Buscar
Mostrando ítems 1-10 de 66
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
Classical properties of algebras using a new graph association
(Cornell University, 2017)
We study the relation between algebraic structures and Graph Theory. We have de ned ve di erent weighted digraphs associated to a nite dimensional algebra over a eld in order to tackle important properties of the ...
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
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
Resultados recientes sobre mosaicos de Penrose
(Real Sociedad Matemática Española, 2003)
Artículo
On Sedlacek's C-Graphs
(Societatea de Științe Matematice din România, 1993)
In this Note, we study some properties of Sedlacek's C-graphs (see [3], [4] and [5]). In particular, we give new methods to build infinite families of C-graphs starting by a C-graph, and we study the relationship between ...
Artículo
Optimal Divisions of a Convex Body
(Ele-Math, 2023)
For a convex body C in Rd andadivision of C into convex subsets C1,...,Cn, we can consider max{F(C1),...,F(Cn)} (respectively, min{F(C1),...,F(Cn)}), where F represents one of these classical geometric magnitudes: the ...
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
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 ...