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 MyObserver, including all inherited members.
after_create_edge(Halfedge_handle e) | MyObserver | inlinevirtual |
after_modify_edge(Halfedge_handle e) | MyObserver | inlinevirtual |
after_split_edge(Halfedge_handle e1, Halfedge_handle e2) | MyObserver | inlinevirtual |
before_create_edge(const X_monotone_curve_2 &s, Vertex_handle v1, Vertex_handle v2) | MyObserver | inlinevirtual |
before_modify_edge(Halfedge_handle e, const X_monotone_curve_2 &s) | MyObserver | inlinevirtual |
before_split_edge(Halfedge_handle e, Vertex_handle v, const X_monotone_curve_2 &s1, const X_monotone_curve_2 &s2) | MyObserver | inlinevirtual |
MyObserver(Arrangement &arr) | MyObserver | inline |
setOriginalSeg(Segment seg) | MyObserver | inline |
setStarterEdge(bool b) | MyObserver | inline |