![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() |
A bounded plane convex region symmetric about a Lattice Point and with Area must contain at
least three Lattice Points in the interior. In
-D, the theorem can be generalized to a region
with Area
, which must contain at least three Lattice Points. The theorem can be derived from
Blichfeldt's Theorem.
See also Blichfeldt's Theorem