An algorithm for solving the open gallery problem

Given a polygon and a desired number of guards resulting after performing an reflex vertex straddling (RVS) deployment or a polygonal triangulation, our objective is to find the minimum number of guards that could cover the entire polygon, that is, each point on the polygon should be visible to at l...

Full beskrivning

Bibliografiska uppgifter

I publikationen:	Philippine computing journal 4, 1 (2009(Mr)).
Huvudupphovsman:	Robles, Marianne M.
Övriga upphovsmän:	Pasia, Joseph M., Adorna, Henry N.
Materialtyp:	Artikel
Språk:	English
Ämnen:	Polygons. Parallel Tree Sweep Strategy (PTSS). Reflex vertex straddling (RVS). Triangulation of the polygon. Searchlight Scheduling Problem. Distributed One Way Sweep Strategy (DOWSS). Algorithm.