@inproceedings{0c14357b302e463bbf67e4328ecac88d,
title = "On minimal moment of inertia polyominoes",
abstract = "We analyze the moment of inertia , relative to the center of gravity, of finite plane lattice sets S. We classify these sets according to their roundness: a set S is rounder than a set T if . We show that roundest sets of a given size are strongly convex in the discrete sense. Moreover, we introduce the notion of quasi-discs and show that roundest sets are quasi-discs. We use weakly unimodal partitions and an inequality for the radius to make a table of roundest discrete sets up to size 40. Surprisingly, it turns out that the radius of the smallest disc containing a roundest discrete set S is not necessarily the radius of S as a quasi-disc.",
keywords = "Discrete sets, Lattice paths, Moment of inertia, Polyominoes",
author = "Sre{\v c}ko Brlek and Gilbert Labelle and Annie Lacasse",
year = "2008",
doi = "10.1007/978-3-540-79126-3\_27",
language = "English",
isbn = "3540791256",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "299--309",
booktitle = "Discrete Geometry for Computer Imagery - 14th IAPR International Conference, DGCI 2008, Proceedings",
note = "14th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2008 ; Conference date: 16-04-2008 Through 18-04-2008",
}