  We consider the problem of taking an opaque forest and determining the
regions that are covered by it. We provide a tight upper bound on the
complexity of this problem, and an algorithm for computing this area, which is
worst-case optimal.
