AbstractA dissection of a planar polygon K is a family of triangles whose union is K and such that the intersection of the interiors of any two distinct triangles is empty. If all the triangles have equal areas, the dissection is called an equidissection of K. An equidissection of K into m triangles is called an m-equidissection of K. It is known that in any m-equidissection of a square m is even. It has also been shown that in any m-equidissection of the regular n-gon, n≥5, m is a multiple of n and that in any m-equidissection of a centrally symmetric polygon m is even.In the present paper we explore equidissections of more general polygons. For instance, we show that for almost all polygons no equidissection exists. Furthermore, there are...
AbstractFor each value of k⩾2, we determine the number pn of ways of dissecting a polygon in the pro...
We survey results on equiangular n-vertex polygons with edge lengths in arithmetic progression. Such...
AbstractA hinged dissection of a set of polygons S is a collection of polygonal pieces hinged togeth...
AbstractA dissection of a planar polygon K is a family of triangles whose union is K and such that t...
AbstractWe investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two pa...
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...
AbstractWe investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two pa...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
It has been proved that any two polygons having the same area are scissors congruent by Bolyai in 18...
AbstractLet T be a non-equilateral triangle. We prove that the number of non-similar triangles Δ suc...
AbstractFor each value of k⩾2, we determine the number pn of ways of dissecting a polygon in the pro...
We survey results on equiangular n-vertex polygons with edge lengths in arithmetic progression. Such...
AbstractA hinged dissection of a set of polygons S is a collection of polygonal pieces hinged togeth...
AbstractA dissection of a planar polygon K is a family of triangles whose union is K and such that t...
AbstractWe investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two pa...
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...
AbstractWe investigate equidissections of a trapezoid T(a), where the ratio of the lengths of two pa...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
Basic properties of polygons in Euclidean space and some related regularity questions were explored...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
It has been proved that any two polygons having the same area are scissors congruent by Bolyai in 18...
AbstractLet T be a non-equilateral triangle. We prove that the number of non-similar triangles Δ suc...
AbstractFor each value of k⩾2, we determine the number pn of ways of dissecting a polygon in the pro...
We survey results on equiangular n-vertex polygons with edge lengths in arithmetic progression. Such...
AbstractA hinged dissection of a set of polygons S is a collection of polygonal pieces hinged togeth...