工程艺术画廊
Engineering Art Galleries
摘要:
画廊问题是计算几何中最著名的问题之一,在算法、复杂性和变量的研究方面有着丰富的历史。最近,关于这个问题的实验工作激增。在这次调查中,我们描述了这项工作,显示的发展年表,并比较目前的算法,包括两个未发表的版本,在一个详尽的实验。此外,我们展示了核心算法成分导致最近的成功。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。