English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

Engineering Art Galleries

MPS-Authors
/persons/resource/persons135692

Friedrichs,  Stephan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1410.8720.pdf
(Preprint), 664KB

Supplementary Material (public)
There is no public supplementary material available
Citation

de Rezende, P. J., de Souza, C. C., Friedrichs, S., Hemmer, M., Kröller, A., & Tozoni, D. C. (2014). Engineering Art Galleries. Retrieved from http://arxiv.org/abs/1410.8720.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-43B6-8
Abstract
The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this survey, we describe this work, show the chronology of developments, and compare current algorithms, including two unpublished versions, in an exhaustive experiment. Furthermore, we show what core algorithmic ingredients have led to recent successes.