\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.8.1 - 2D Visibility
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Bibliographic References
[1]

T. Asano. An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Transactions (1976-1990), (9):557–559, 1985.

[2]

Francisc Bungiu, Michael Hemmer, John Hershberger, Kan Huang, and Alexander Kröller. Efficient computation of visibility polygons. CoRR, abs/1403.3905, 2014.

[3]

E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns – Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.

[4]

B. Joe and R.B. Simpson. Corrections to lee's visibility polygon algorithm. BIT, 27:458–473, 1987.

[5]

D. T. Lee. Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing, 22:207–221, 1983.