A Practical Algorithm with Performance Guarantees for the Art Gallery Problem

Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely. The only currently correct algorithm to solve the art gallery problem exactly use...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 25:2; no. Discrete Algorithms
Main Authors:	Hengeveld, Simon, Miltzow, Tillmann
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 24.06.2024
Subjects:	computer science - computational geometry computer science - data structures and algorithms computer science - discrete mathematics
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!