Computing the Coverage of an Opaque Forest
arXiv:1311.4854
Abstract
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.
4 pages, 7 figures. Accepted and presented at the 24th annual Canadian Conference on Computational Geometry (2012)