2000 character limit reached
Efficient Computation of Visibility Polygons (1403.3905v1)
Published 16 Mar 2014 in cs.CG
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).