Visibility Extension via Reflective Edges to an Exact Quantity

11/19/2018
by   Arash Vaezi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2017

Expanding Visibility Polygons by Mirrors upto at least K units

We consider extending visibility polygon (VP) of a given point q (VP(q))...
research
06/05/2019

On Colourability of Polygon Visibility Graphs

We study the problem of colouring visibility graphs of polygons. In part...
research
09/05/2017

Guarding Path Polygons with Orthogonal Visibility

We are interested in the problem of guarding simple orthogonal polygons ...
research
11/05/2020

Visibility Extension via Reflection

This paper studies a variant of the Art-gallery problem in which "walls"...
research
08/19/2017

Minimum Hidden Guarding of Histogram Polygons

A hidden guard set G is a set of point guards in polygon P that all ...
research
11/08/2020

The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable

The Hierarchical Chinese Postman Problem is finding a shortest traversal...
research
10/25/2018

Art Gallery Problem with Rook Vision

We introduce rook visibility, which is a new model of visibility for the...

Please sign up or login with your details

Forgot password? Click here to reset