2 papers
math.MG2009
If you can hide behind it, can you hide inside it?
Daniel A. Klain
Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more conv…
math.MG2008
Covering shadows with a smaller volume
Daniel A. Klain
For each i = 1, ..., n constructions are given for convex bodies K and L in n-dimensional Euclidean space such that each rank i orthogonal projection of K can be translated inside…