Feynman Lectures on Computation
Feynman Lectures on Computation
Introduction to Maple
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Perceptrons: An Introduction to Computational Geometry
Perceptrons: An Introduction to Computational Geometry
The discrete Green Theorem and some applications in discrete geometry
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On minimal perimeter polyminoes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Combinatorial view of digital convexity
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
We analyze the moment of inertia I(S), 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 I(S) T). 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.