Efficient Computation of Visibility Polygons
Computational Geometry
2014-03-18 v1
Abstract
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computational Geometry Algorithms Library (CGAL).
Cite
@article{arxiv.1403.3905,
title = {Efficient Computation of Visibility Polygons},
author = {Francisc Bungiu and Michael Hemmer and John Hershberger and Kan Huang and Alexander Kröller},
journal= {arXiv preprint arXiv:1403.3905},
year = {2014}
}