Nadzor galerij

diplomsko delo

Sandi Cof (Author), Matija Cencelj (Mentor), Boštjan Gabrovšek (Co-mentor)

Abstract

Obravnavamo osnovni problem varovanja galerij, katerih tlorisi so enostavni poligoni z n oglišči, varnostnike pa postavljamo v oglišča. Preko primera poligona z n oglišči pokažemo, da obstaja poligon, ki za nadzor potrebuje floor(n / 3) varnostnikov. S triangulacijo poligona in 3-barvanjem podamo algoritem, ki nam najde postavitev varnostnikov pri kateri floor(n / 3) varnostnikov zadosti za nadzor celotne galerije. Obravnavamo tudi delitev poligona na y-monotone dele in njihovo triangulacijo. Delovanje algoritmov ponazorimo na primerih.

Keywords

problem galerije;varovanje galerij;varnostniki;triangulacija;poligoni;primeri simuliranja algoritmov;

Data

Language:	Slovenian
Year of publishing:	2016
Typology:	2.11 - Undergraduate Thesis
Organization:	UL PEF - Faculty of Education
Publisher:	[S. Cof]
UDC:	51:069:7(043.2)
COBISS:	11134793
Views:	950
Downloads:	154
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Guarding art galleries
Secondary abstract:	We present the classical art gallery problem where the floor is a simple polygon with n vertices and we guard it by vertex guards. With an example which needs floor(n / 3) vertex guards, we proof that floor(n / 3) vertex guards might be necessary. By a triangulation of polygon and 3-coloring we give an algorithm which finds a placement for vertex guards where floor(n / 3) guards are sufficient to cover the entire polygon. We continue with presenting a division of the polygon into y-monotone pieces which we further triangulate. We simulate algoritms on examples.
Secondary keywords:	galery;mathematics;galerija;matematika;
File type:	application/pdf
Type (COBISS):	Undergraduate thesis
Thesis comment:	Univ. v Ljubljani, Pedagoška fak., Matematika in računalništvo
Pages:	VIII, 176 str.
ID:	9166313