Convex hulls of polyominoes
Combinatorics
2007-05-23 v1
Abstract
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the extremal polyominoes and determine the set of possible areas of the convex hull for each n.
Cite
@article{arxiv.math/0702786,
title = {Convex hulls of polyominoes},
author = {Sascha Kurz},
journal= {arXiv preprint arXiv:math/0702786},
year = {2007}
}
Comments
13 pages, 10 figures