Computing the Coverage of an Opaque Forest
Computational Geometry
2013-11-22 v2
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.
Cite
@article{arxiv.1311.4854,
title = {Computing the Coverage of an Opaque Forest},
author = {Alexis Beingessner and Michiel Smid},
journal= {arXiv preprint arXiv:1311.4854},
year = {2013}
}
Comments
4 pages, 7 figures. Accepted and presented at the 24th annual Canadian Conference on Computational Geometry (2012)