Isoperimetrically Optimal Polyforms
نویسندگان
چکیده
In the plane, the way to enclose the most area with a given perimeter and to use the shortest perimeter to enclose a given area, is always to use a circle. If we replace the plane by a regular tiling of it, and construct polyforms i.e. shapes as sets of tiles, things become more complicated. We need to redefine the area and perimeter measures, and study the consequences carefully. A spiral construction often provides, for every integer number of tiles (area), a shape that is most compact in terms of the perimeter or boundary measure; however it may not exhibit all optimal shapes. We characterize in this paper all shapes that have both shortest boundaries and maximal areas for three common planar discrete spaces.
منابع مشابه
On a gap phenomenon for isoperimetrically constrained variational problems
We consider functional of the calculus of variations subjected to constraints of the form / g(x,u)dx = 1. Jn We identify the relaxed problem and we show that, when a lack of compactness occurs, the constraint may relax to a gap term.
متن کاملAdding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the polyform and not part of the polyform. A bumped-body polyform has two parts: a body and a bump. Adding a layer to a bumped-body polyform with minimum perimeter constructs a bumped-body polyform with min perimeter; the ...
متن کاملHinged Dissection of Polyominoes and Polyforms
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be rotated 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...
متن کاملHinged dissections of polyominoes and polyforms
This paper shows how to hinge together a collection of polygons at vertices in such a way that a single object can be reshaped into any n-omino, for a given value of n. An n-omino is de ned generally as a connected union of n unit squares on the integer grid. Our best dissection uses 2(n 1) polygons. We generalize this result to the connected unions of nonoverlapping equal-size regular k-gons j...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کامل