|
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
|
This is the complete list of members for IGrid, including all inherited members.
| _debug (defined in IGrid) | IGrid | protected |
| _grid (defined in IGrid) | IGrid | protected |
| _gridMem (defined in IGrid) | IGrid | protected |
| _gridTime (defined in IGrid) | IGrid | protected |
| _polygon (defined in IGrid) | IGrid | protected |
| _struct1 (defined in IGrid) | IGrid | protected |
| _struct2 (defined in IGrid) | IGrid | protected |
| _visOk (defined in IGrid) | IGrid | protected |
| _visPol (defined in IGrid) | IGrid | protected |
| addGridPoint(Point p) | IGrid | |
| getGridMem() | IGrid | inline |
| getGridPoints() | IGrid | inline |
| getStruct1() | IGrid | inline |
| getStruct2() | IGrid | inline |
| IGrid() | IGrid | inline |
| makeGrid()=0 | IGrid | pure virtual |
| setPolygon(PolygonWithHolesExt polygon) | IGrid | |
| setVisibilityPolygons(std::vector< PolygonExt > visPol) | IGrid | |
| ~IGrid() (defined in IGrid) | IGrid | inlinevirtual |
1.8.6