Abstract
The isodiametric problem in the Euclidean plane is solved for
lattice-point-free convex sets: we characterize the planar convex sets containing
no points of the rectangular lattice in their interior, which have maximum area,
for each given value of the diameter. Then we use this result for giving also
an answer to the isodiametric problem in the case of an arbitrary lattice.
Lingua originale | English |
---|---|
Numero di pagine | 18 |
Stato di pubblicazione | Pubblicato - 2005 |
Keywords
- convessità
- convex sets
- disuguaglianze
- inequalities
- point lattice
- reticoli di punti