Login / Signup
Finding the optimal shadows of a convex polytope.
Michael McKenna
Raimund Seidel
Published in:
SCG (1985)
Keyphrases
</>
convex hull
finding optimal
globally optimal
semi infinite programming
piecewise linear
dynamic programming
lattice points
stable set
closed form
worst case
moving objects
directed graph
convex optimization
optimal control
light source
optimal design
single image
graph cuts