DocumentCode :
2601684
Title :
Isoperimetrically Pareto-optimal shapes on the hexagonal grid
Author :
Vainsencher, Daniel ; Bruckstein, Alfred M.
Author_Institution :
Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa
fYear :
2008
fDate :
Jan. 27 2008-Feb. 1 2008
Firstpage :
507
Lastpage :
522
Abstract :
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 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. In this paper we characterize all shapes that have both shortest boundaries and maximal areas for one particular boundary measure on the hexagon tiling. We show this set of Pareto optimal shapes is the same as that induced by a different boundary measure that was studied in the context of theoretical chemistry.
Keywords :
geometry; boundary measure; hexagon tiling; hexagonal grid; isoperimetrically Pareto optimal shapes; regular tiling; Area measurement; Chemistry; Computer science; Game theory; Length measurement; Particle measurements; Shape measurement; Size measurement; Tiles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop, 2008
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2670-6
Type :
conf
DOI :
10.1109/ITA.2008.4601018
Filename :
4601018
Link To Document :
بازگشت