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...
| 發表在: | Philippine computing journal 4, 1 (2009(Mr)). |
|---|---|
| 主要作者: | |
| 其他作者: | , |
| 格式: | Article |
| 語言: | English |
| 主題: |