Conflict-free guarding problems in the plane – Bc. Samuel Čepela
Bc. Samuel Čepela
Bachelor's thesis
Conflict-free guarding problems in the plane
Conflict-free guarding problems in the plane
Abstract:
Problém galérie umenia je známym výsledkom výpočtovej geometrie, ktorý vyžaduje minimálny počet strážcov potrebných na stráženie umeleckej galérie. V tejto práci sa zameriame na chromatickú verziu tohto problému, ktorá požaduje zafarbenie strážcov minimálnym počtom farieb dodržujúc tzv. "conflict-free" podmienku. Podrobne analyzujeme známe dôkazy hornej hranice a zároveň skúmame väčšinu známych výsledkov …moreAbstract:
The Art gallery problem is a famous result in computational geometry, asking for the minimum number of guards needed to guard an art gallery. In this thesis, we will focus on a chromatic version of this problem, which asks to color the guards using a minimal number of colors under the so-called conflict-free condition. We analyze the known upper-bound proofs in detail while surveying most of the known …more
Language used: English
Date on which the thesis was submitted / produced: 18. 5. 2023
Identifier:
https://is.muni.cz/th/iua7p/
Thesis defence
- Date of defence: 30. 6. 2023
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: RNDr. Filip Pokrývka
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Informatics
Theses on a related topic
- No theses on a related topic available.