Densest tanslational lattice packing of non-convex polygons (extended abstract).
Victor MilenkovicPublished in: SCG (2000)
Keyphrases
- extended abstract
- minkowski sum
- convex hull
- digital convexity
- convex optimization
- graph mining
- convex sets
- lattice structure
- piecewise linear
- packing problem
- convex polyhedra
- convex relaxation
- convex constraints
- lattice points
- concept lattice
- learning algorithm
- globally optimal
- data sets
- risk minimization
- geometric properties