A practical algorithm with performance guarantees for the art gallery problem
S Hengeveld, T Miltzow - Discrete Mathematics & …, 2024 - dmtcs.episciences.org
Discrete Mathematics & Theoretical Computer Science, 2024•dmtcs.episciences.org
A chord is a straight line within a polygon connecting two non-adjacent vertices. Given such
a chord c of a polygon, we denote by n (c) the number of vertices visible from c. The chord-
visibility width (cw (P)) of a polygon is the maximum n (c) over all possible chords c. The set
of vision-stable polygons admit an FPT algorithm when parameterized by the chord-visibility
width. Furthermore, the one-shot algorithm runs in FPT time when parameterized by the
number of reflex vertices.
a chord c of a polygon, we denote by n (c) the number of vertices visible from c. The chord-
visibility width (cw (P)) of a polygon is the maximum n (c) over all possible chords c. The set
of vision-stable polygons admit an FPT algorithm when parameterized by the chord-visibility
width. Furthermore, the one-shot algorithm runs in FPT time when parameterized by the
number of reflex vertices.
A chord is a straight line within a polygon connecting two non-adjacent vertices. Given such a chord c of a polygon, we denote by n (c) the number of vertices visible from c. The chord-visibility width (cw (P)) of a polygon is the maximum n (c) over all possible chords c. The set of vision-stable polygons admit an FPT algorithm when parameterized by the chord-visibility width. Furthermore, the one-shot algorithm runs in FPT time when parameterized by the number of reflex vertices.
dmtcs.episciences.org
Showing the best result for this search. See all results