Hinged Dissection of Polyominoes and Polyforms

Details Hinged Dissection of Polyominoes and Polyforms Hinged Dissection of Polyominoes and Polyforms

1999-07-10

arxiv.org/abs/cs/9907018v3

Computer Science

Computational Geometry

27 pages, 39 figures. Accepted to Computational Geometry: Theory and Applications. v3 incorporates several comments by referee

Scientific paper

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a polygon P that join corresponding edges of P. This construction uses kn pieces, where k is the number of vertices of P. When P is a regular polygon, we show how to reduce the number of pieces to ceiling(k/2)*(n-1). In particular, we consider polyominoes (made up of unit squares), polyiamonds (made up of equilateral triangles), and polyhexes (made up of regular hexagons). We also give a hinged dissection of all polyabolos (made up of right isosceles triangles), which do not fall under the general result mentioned above. Finally, we show that if P can be hinged into Q, then any edge-to-edge gluing of n congruent copies of P can be hinged into any edge-to-edge gluing of n congruent copies of Q.

Affiliated with

Also associated with

No associations

Rating

Hinged Dissection of Polyominoes and Polyforms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hinged Dissection of Polyominoes and Polyforms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hinged Dissection of Polyominoes and Polyforms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653361