Elisabet Ivanna Grace Handayani, - (2020) ART GALLERY PROBLEM UNTUK 1-GUARDED GUARDS DAN 2-GUARDED GUARDS PADA POLIGON ORTHOGONAL. S1 thesis, Universitas Pendidikan Indonesia.
![[img]](http://repository.upi.edu/style/images/fileicons/text.png) |
Text
S_MAT_1601501_TITLE.pdf Download (676kB) |
|
Text
S_MAT_1601501_CHAPTER 1.pdf Download (403kB) |
|
Text
S_MAT_1601501_CHAPTER 2.pdf Restricted to Staf Perpustakaan Download (780kB) |
|
Text
S_MAT_1601501_CHAPTER 3.pdf Download (503kB) |
|
Text
S_MAT_1601501_CHAPTER 4.pdf Restricted to Staf Perpustakaan Download (422kB) |
|
Text
S_MAT_1601501_CHAPTER 5.pdf Download (268kB) |
Abstract
ABSTRAK Art Gallery Problem for k-guarded guards adalah masalah menentukan jumlah k-guarded guards yang dapat mengawasi seluruh bagian poligon dengan n simpul. K-guarded guards adalah penjaga yang dapat melihat sebanyak k penjaga lainnya. Penempatan k-guarded guards sangat dibutuhkan pada kehidupan sehari-hari, khususnya untuk meningkatkan pengawasan di suatu ruangan dari pencurian yang bukan hanya berasal dari pengunjung luar, tetapi juga penjaga. Penelitian ini membahas art gallery problem for k-guarded guards pada poligon orthogonal untuk k = 1 dan k = 2. Poligon orthogonal adalah poligon yang memiliki sisi yang digambarkan oleh sejumlah pasangan sumbu koordinat kartesius yaitu garis horizontal dan vertical yang saling tegak lurus dan membentuk sudut dalam sebesar 90° atau 270°. Untuk k=1 yang dikenal dengan art gallery problem for 1-guarded guards, masalah telah diselesaikan melalui konsep pewarnaan graf. Penelitian ini mengkontruksi teorema baru melalui konsep yang sama sebagai penyelesaian untuk k=2 atau yang dikenal sebagai art gallery problem for 2-guarded guards dan mengimplementasikan penempatan 1-guarded guards pada suatu toserba di kota Bandung. ABSTRACT Art Gallery problem for k-guarded guards is the problem to find the minimum number of k-guarded guards that are always sufficient and sometimes necessary to protect a polygon with n vertices. A k-guarded guard is a guard that can see k other guards. Placing k-guarded guards are required in this day, especially to increase rooms protection from the theft that may be not only visitors but also guards. This research discuss about art gallery problem for k-guarded guards in orthogonal polygon for k=1 and k=2. An Orthogonal poligon is a poligon which edges are all aligned with a pair of orthogonal coordinate axes, which we take to be horizontal and vertical, and always meet orthogonally, with internal angles of either 90° or 270°. For k=1 which is known by art gallery problem for 1-guarded guards was solved by graph coloring arguments. This research discuss a new theorem to settle the problem for k=2 that is known by art gallery problem for 2-guarded guards, and implement 1-guarded guards placement in one of department store in Bandung.
| Item Type: | Thesis (S1) |
|---|---|
| Uncontrolled Keywords: | Art gallery problem for guarded guards, art gallery problem for 2-guarded guards, orthogonal polygon, graph coloring. |
| Subjects: | L Education > L Education (General) Q Science > QA Mathematics |
| Divisions: | Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Jurusan Pendidikan Matematika > Program Studi Matematika (non kependidikan) |
| Depositing User: | Elisabet Ivanna Grace Handayani |
| Date Deposited: | 19 Feb 2020 02:20 |
| Last Modified: | 19 Feb 2020 02:20 |
| URI: | http://repository.upi.edu/id/eprint/46472 |
Actions (login required)
 |
View Item |