Efficient Computation of Visibility Polygons
Francisc Bungiu, Michael Hemmer, John Hershberger, Kan Huang, and Alexander Kr\"oller
TL;DR
This paper introduces new implementations and experimental evaluations of algorithms for computing visibility polygons in planar polygons, contributing to computational geometry tools.
Contribution
It presents a new package for CGAL with optimized implementations of two established and one novel visibility polygon algorithms.
Findings
Algorithms perform efficiently in experiments
New package enhances CGAL's capabilities
Experimental results validate algorithm effectiveness
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Numerical Analysis Techniques · Computer Graphics and Visualization Techniques