The Contiguous Art Gallery Problem is Solvable in Polynomial Time

書目詳細資料

發表在:	arXiv.org (Dec 18, 2024), p. n/a
主要作者:	Magnus Christian Ring Merrild
其他作者:	Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Svenning, Rolf
出版:	Cornell University Library, arXiv.org
主題:	Apexes Algorithms Polygons Computational geometry Polynomials Art galleries & museums Greedy algorithms Run time (computers)
在線閱讀:	Citation/Abstract Full text outside of ProQuest
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!