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

Additional Metadata
Conference 24th Canadian Conference on Computational Geometry, CCCG 2012
Citation
Beingessner, A. (Alexis), & Smid, M. (2012). Computing the coverage of an opaque forest. Presented at the 24th Canadian Conference on Computational Geometry, CCCG 2012.