Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter

نویسنده

  • Winston C. Yang
چکیده

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 triangle case requires additional assumptions. A similar result holds for 3D polyominos with minimum area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 cons...

متن کامل

Counting polyominoes with minimum perimeter

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

متن کامل

Polyominoes with minimum site-perimeter and full set achievement games

The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula for the minimum site-perimeter with a given cell size is found. This formula is used to show the effectiveness of a simple random strategy in polyomino set achievement games.

متن کامل

Polyiamonds and Polyhexes with Minimum Site-Perimeter and Achievement Games

An animal is an edge connected set of nitely many cells of a regular tiling of the plane. The site-perimeter of an animal is the number of empty cells connected to the animal by an edge. The minimum site-perimeter with a given cell size is found for animals on the triangular and hexagonal grid. The formulas are used to show the e ectiveness of a simple random strategy in full set animal achieve...

متن کامل

Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition

This paper presents a fast algorithm that provides optimal or near optimal solutions to the minimum perimeter problem on a rectangular grid. The minimum perimeter problem is to partition a grid of size M×N into P equal area regions while minimizing the total perimeter of the regions. The approach taken here is to divide the grid into stripes that can be filled completely with an integer number ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2006