Visibility Extension via Reflective Edges to an Exact Quantity
Computational Complexity
2018-11-20 v1
Abstract
We consider extending the visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely units of area to are NP-complete. The optimal cases are NP-hard. We are unaware of any result on adding an exact number to a polygon, or covering an area with an exact surface. We deal with both single and multiple reflecting mirrors for both specular or diffuse types of reflections.
Keywords
Cite
@article{arxiv.1811.07649,
title = {Visibility Extension via Reflective Edges to an Exact Quantity},
author = {Arash Vaezi and Mohammad Ghodsi},
journal= {arXiv preprint arXiv:1811.07649},
year = {2018}
}