Some covering problems for general planar lattices (Q2707497)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some covering problems for general planar lattices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some covering problems for general planar lattices |
scientific article |
Statements
24 January 2002
0 references
covering
0 references
inequalities
0 references
lattice-point-free convex sets
0 references
area
0 references
perimeter
0 references
diameter
0 references
minimal width
0 references
inradius
0 references
circumradius
0 references
0 references
0 references
0 references
0 references
0 references
0.9004378
0 references
0 references
Some covering problems for general planar lattices (English)
0 references
This note presents a number of inequalities for planar lattice-point-free convex sets concerning the area, perimeter, diameter, minimal width, inradius and circumradius. They easily follow from a few well-known inequalities of this kind by combining them and applying only simple arithmetic operations.NEWLINENEWLINEFor the entire collection see [Zbl 0948.00038].
0 references
