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

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Hengeveld, Simon, Tillmann Miltzow
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 11.06.2024
Predmet:	Algebra Algorithms Apexes Art galleries & museums Chords (geometry) Guards Iterative algorithms Iterative methods Parameterization Polygons Polynomials Set theory Stability Vision
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!