Classical dissections convert any planar polygonal region onto any other polygonal region having the same area. If two convex polygonal regions are isoparametric, that is, have equal areas and equal perimeters, our main result states that there is always a dissection, called a complete dissection, that converts not only the regions but also their boundaries onto one another. The proof is constructive and provides a general method for complete dissection using frames of constant width. This leads to a new object of study: isoparametric polygonal frames, for which we show that a complete dissection of one convex polygonal frame onto any other always exists. We also show that every complete dissection can be done without flipping any o...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
Tematem niniejszej pracy jest cięcie i składanie wielokątów z zachowaniem brzegów. Głównym celem jes...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
We prove that any finite collection of polygons of equal area has a common hinged dissection. That...
Abstract. Given a convex quadrilateral Q having a certain property P, we are interested in finding a...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
AbstractLet M ⊂ E2 be an open, connected and bounded polygonal region with polygonal holes of dimens...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
\u3cp\u3eWe consider the problem of testing, for a given set of planar regions R and an integer k, w...
In 2000 A. Bezdek asked which plane convex bodies have the property that whenever an annulus, consis...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...
Classical dissections convert any planar polygonal region onto any other polygonal region having th...
Tematem niniejszej pracy jest cięcie i składanie wielokątów z zachowaniem brzegów. Głównym celem jes...
The open problem of whether or not every pair of equal-area polygons has a hinged dissection is disc...
We prove that any finite collection of polygons of equal area has a common hinged dissection. That...
Abstract. Given a convex quadrilateral Q having a certain property P, we are interested in finding a...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
AbstractLet M ⊂ E2 be an open, connected and bounded polygonal region with polygonal holes of dimens...
summary:We define a proper triangulation to be a dissection of an integer sided equilateral triangle...
It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the com...
\u3cp\u3eWe consider the problem of testing, for a given set of planar regions R and an integer k, w...
In 2000 A. Bezdek asked which plane convex bodies have the property that whenever an annulus, consis...
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, w...
We study the minimum number g(m, n) (respectively, p(m, n)) of pieces needed to dissect a regular m-...
We consider the problem of testing, for a given set of planar regions R and an integer k, whether th...