Discrete sets with minimal moment of inertia

Authors:
S. Brlek;G. Labelle;A. Lacasse
Affiliations:
LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale Centre-Ville, Montréal (QC), Canada H3C 3P8;LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale Centre-Ville, Montréal (QC), Canada H3C 3P8;LaCIM, Université du Québec à Montréal, C. P. 8888 Succursale Centre-Ville, Montréal (QC), Canada H3C 3P8
Venue:
Theoretical Computer Science
Year:
2008

Citing 7
Cited 0

Introduction to Maple

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)
Maximum Likelihood Estimation of Markov-Process Blob Boundaries in Noisy Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
On minimal perimeter polyminoes

DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Digital Convexity, Straightness, and Convex Polygons

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	5.23

Visualization

Abstract

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)