The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Bibliografske podrobnosti

izdano v:	arXiv.org (Dec 18, 2024), p. n/a
Glavni avtor:	Magnus Christian Ring Merrild
Drugi avtorji:	Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Svenning, Rolf
Izdano:	Cornell University Library, arXiv.org
Teme:	Apexes Algorithms Polygons Computational geometry Polynomials Art galleries & museums Greedy algorithms Run time (computers)
Online dostop:	Citation/Abstract Full text outside of ProQuest
Oznake:	Označite Brez oznak, prvi označite!