pith. sign in

arxiv: 1403.3905 · v1 · pith:QDK7MQ4Rnew · submitted 2014-03-16 · 💻 cs.CG

Efficient Computation of Visibility Polygons

Francisc Bungiu , Michael Hemmer , John Hershberger , Kan Huang , Alexander Kr\"oller This is my paper
classification 💻 cs.CG
keywords algorithmspolygonsvisibilitycomputationalgeometryalgorithmarrangementscgal
0
0 comments X
read the original 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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Smooth Feedback Motion Planning with Reduced Curvature

    cs.RO 2026-04 unverdicted novelty 7.0

    A new alignment heuristic and star-shaped simplex chain construction for feedback motion planning reduces average path bending by 91.4% and LQR effort by 45.5% while remaining computationally efficient.