Densest Packing of Typical Convex Sets are Nont Lattice-Like.

Gábor Fejes Tóth

Published in: Discret. Comput. Geom. (1995)

Keyphrases

convex sets
finite number
convex optimization
variational inequalities
image recovery
convex hull
higher dimensional
feasible set
packing problem
quasiconvex
image processing
probability density function
total variation
image restoration