Computing the Coverage of an Opaque Forest
classification
💻 cs.CG
keywords
computingforestopaqueproblemalgorithmareaboundcomplexity
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.