The Contiguous Art Gallery Problem is Solvable in Polynomial Time

Bibliografski detalji

Izdano u:	arXiv.org (Dec 18, 2024), p. n/a
Glavni autor:	Magnus Christian Ring Merrild
Daljnji autori:	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 pristup:	Citation/Abstract Full text outside of ProQuest
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!