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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 25:2; číslo Discrete Algorithms
Hlavní autori:	Hengeveld, Simon, Miltzow, Tillmann
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 24.06.2024
Predmet:	computer science - computational geometry computer science - data structures and algorithms computer science - discrete mathematics
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!