Pith. sign in

REVIEW 1 cited by

Efficient Computation of Visibility Polygons

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1403.3905 v1 pith:QDK7MQ4R submitted 2014-03-16 cs.CG

Francisc Bungiu , Michael Hemmer , John Hershberger , Kan Huang , Alexander Kröller This is my paper · ORCID
classification cs.CG
keywords algorithmspolygonsvisibilitycomputationalgeometryalgorithmarrangementscgal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions

    cs.CG 2025-06 conditional novelty 5.0 of 10

    A heuristic mesh that minimizes expected triangle edge expansions cuts average visibility-region query times by 12-16% versus constrained Delaunay triangulations on realistic maps.

Pith tools