summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle into smaller, integer sided equilateral triangles such that no point is the vertex of more than three of the smaller triangles. In this paper we establish necessary and sufficient conditions for a proper triangulation of a convex region to exist. Moreover we establish precisely when at least two such equilateral triangle dissections exist. We also provide necessary and sufficient conditions for some convex regions with up to four sides to have either one, or at least two, proper triangulations when an internal triangle is specified
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
The aim of this thesis is to show how the use of parity in tandem with the triangular grid as well a...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
AbstractA segment (=1-cell) of a planar triangulation σ is convex if it is common to two triangles (...
An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for ...
AbstractWe enumerate all dissections of an equilateral triangle into smaller equilateral triangles u...
A new criterion is given for constructing an optimal triangulation of surfaces and bodies. The trian...
AbstractA dissection of a planar polygon K is a family of triangles whose union is K and such that t...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
Abstract. In this paper we study geometrical properties of the iterative 4triangles longest-side par...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
A triangulation of the sphere is combinatorially convex if each vertex is shared by no more than six...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
The aim of this thesis is to show how the use of parity in tandem with the triangular grid as well a...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
AbstractA segment (=1-cell) of a planar triangulation σ is convex if it is common to two triangles (...
An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for ...
AbstractWe enumerate all dissections of an equilateral triangle into smaller equilateral triangles u...
A new criterion is given for constructing an optimal triangulation of surfaces and bodies. The trian...
AbstractA dissection of a planar polygon K is a family of triangles whose union is K and such that t...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
Abstract. In this paper we study geometrical properties of the iterative 4triangles longest-side par...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
A triangulation of the sphere is combinatorially convex if each vertex is shared by no more than six...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
The aim of this thesis is to show how the use of parity in tandem with the triangular grid as well a...
Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the int...