Login / Signup
The Densest Double-Lattice Packing of a Convex Polygon.
David M. Mount
Published in:
Discrete and Computational Geometry (1990)
Keyphrases
</>
convex hull
minkowski sum
convex optimization
packing problem
graph mining
convex polyhedra
lattice structure
concept lattice
strictly convex
convex sets
algebraic structure
lattice points
data points
convex functions
risk minimization
digital convexity