# Efficient Computation of Visibility Polygons

arXiv: https://arxiv.org/abs/1403.3905 · HTML: https://mlsanity.com/paper/1403.3905/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Mar 2014.

## Built on by (most cited first, 1 of 1)

- [Mechanical Search on Shelves using a Novel "Bluction" Tool](https://mlsanity.com/paper/2201.08968/) (2022)

## Abstract (arXiv)

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).