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
 All Classes Functions
Public Member Functions | List of all members
PolygonExt Class Reference
Inheritance diagram for PolygonExt:

Public Member Functions

 PolygonExt (Polygon pol)
 
Point getClosestOnBoundary (Point)
 
PolygonExt getVisibility (Point)
 

Member Function Documentation

Point PolygonExt::getClosestOnBoundary ( Point  z)

Finds the closest point on the boundary to z.

PolygonExt PolygonExt::getVisibility ( Point  z)

Computes the visibility polygon of a point z in P. Algorithm: B. Joe and R. B. Simpson. Visibility of a simple polygon from a point. Report CS-85-38, Dept. Math. Comput. Sci., Drexel Univ., Philadelphia, PA, 1985.


The documentation for this class was generated from the following files: