2018/11/19 by Arash Vaezi, Vaezi, Arash, Mohammad Ghodsi +1
Computer Science · #Advanced Image and Video Retrieval Techniques #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1811.07649
openalex publication_date 2018/11/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider extending the visibility polygon of a given point q, inside a simple polygon P by converting some edges of P to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely k units of area to VP(q) 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.