On minimal moment of inertia polyominoes

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Brlek, S., Labelle, G., & Lacasse, A. (2008). On minimal moment of inertia polyominoes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4992 LNCS, pp. 299–309). https://doi.org/10.1007/978-3-540-79126-3_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free