Corpus ID: 18206196

Efficient Computation of Visibility Polygons

@article{Bungiu2014EfficientCO,
  title={Efficient Computation of Visibility Polygons},
  author={Francisc Bungiu and M. Hemmer and J. Hershberger and Kan Huang and A. Kr{\"o}ller},
  journal={ArXiv},
  year={2014},
  volume={abs/1403.3905}
}
  • Francisc Bungiu, M. Hemmer, +2 authors A. Kröller
  • Published 2014
  • Computer Science
  • 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). 
    19 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Planar lower envelope of monotone polygonal chains
    • D. Lu
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 2015
    Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths
    Shortest Path to a Segment and Quickest Visibility Queries
    • 15
    • PDF
    Experience report: growing and shrinking polygons for random testing of computational geometry algorithms
    • 2
    • Highly Influenced
    • PDF
    Shortest path to a segment and quickest visibility queries
    • 3
    A Practical Algorithm with Performance Guarantees for the Art~Gallery Problem
    The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS
    • 18
    • Highly Influenced
    • PDF
    Algorithms for art gallery illumination
    • 2
    • PDF

    References

    SHOWING 1-10 OF 21 REFERENCES
    An Optimal Algorithm for Computing Visibility in the Plane
    • 41
    • PDF
    Corrections to Lee's visibility polygon algorithm
    • 121
    • Highly Influential
    Visibility of disjoint polygons
    • 124
    Triangulating a simple polygon in linear time
    • B. Chazelle
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 1991
    • 739
    • PDF
    Visibility Queries and Maintenance in Simple Polygons
    • 59
    • PDF
    Worst-case optimal algorithms for constructing visibility polygons with holes
    • 119
    Visibility Algorithms in the Plane
    • 283
    • PDF
    Art gallery theorems and algorithms
    • 1,455
    Computational geometry: algorithms and applications
    • M. Berg
    • Computer Science, Mathematics
    • 1997
    • 5,785
    • PDF
    Efficient computation of query point visibility in polygons with holes
    • 39
    • PDF