|
AGSol (Art Gallery Solver)
1.0.2
This package contains a software capable of optimally solving the Art Gallery Problem (AGP), one interesting NP-hard problem from the Computational Geometry field. The algorithm implemented in this solution, which can be today considered the state-of-the-art technique on the AGP, can be found in details in the following paper: Davi C. Tozoni, Pedro J. de Rezende, Cid C. de Souza. A Practical Iterative Algorithm for the Art Gallery Problem using Integer Linear Programming
|
Public Member Functions | |
| PolygonWithHolesExt (PolygonWithHoles pol) | |
| PolygonWithHolesExt (Polygon pol) | |
| PolygonExt | getVisibility (Point) |
| RT | area () |
| int | size () |
| RT PolygonWithHolesExt::area | ( | ) |
Computes the area of a polygon with holes by removing the area of the boundary polygon and subtracting the area of the holes.
| PolygonExt PolygonWithHolesExt::getVisibility | ( | Point | z | ) |
Computes visibility polygons for polygons with holes. The idea is to use the same algorithm for the class PolygonExt (without holes) and then remove the shadows generated by each hole.
| int PolygonWithHolesExt::size | ( | ) |
Computes the total number of vertices of the polygon with holes.
1.8.6