Indoor Routing in Three Dimensional Spaces (Case Study: Telkom University Bandung)
TIARA ANNISA DIONTI

Informasi Umum

Kode

17.04.933

Klasifikasi

620.007 - Engineering research

Jenis

Karya Ilmiah - Skripsi (S1) - Reference

Subjek

Computer Science

Dilihat

227 kali

Informasi Lainnya

Abstraksi

Spatial data is the data that stores geographic data types. This data is often used on systems that use information related to the territory of a region, such as the routing system or navigation system. The routing system itself has been implemented on the outdoor routing, and over times it began to be developed in the direction of the indoor routing. There is significant difference that make indoor routing more complex than outdoor routing, for example: the outdoor routing only implement routing system in two dimensional spaces, while the indoor routing allows the routing system in three dimensional spaces that represent high rise building. In the case of indoor routing, three dimensional spaces data structure will identify an object accurately by storing spatial data using undirected graph where x and y are the coordinates of a point on sphere, and z represents height level of the point. Shortest path algorithm can be implemented then after the three dimensional spaces structure was built in order to provide output of the shortest route between two points. This final project aims to implement indoor routing system using three dimensional spaces in School of Computing, Telkom University. The system’s outputs are the shortest path and the closed shortest path between two rooms. Based on this research, A* algorithm is the most suitable shortest path algorithm to be implemented in indoor routing system in three dimensional spaces.

• MA2333 - MATEMATIKA DISKRIT
• CS2223 - PEMROGRAMAN BERORIENTASI OBJEK
• MA1223 - ALJABAR LINEAR
• BUG1D2 - BAHASA INGGRIS I
• BUG1E2 - BAHASA INGGRIS II
• BUG2A2 - BAHASA INGGRIS III
• CD1214 - BASIS DATA NON RELASIONAL
• CSG2A3 - ALGORITMA DAN STRUKTUR DATA
• CSG2B1 - PRAKTIKUM ALGORITMA DAN STRUKTUR DATA
• CSG2C3 - INTERAKSI MANUSIA DAN KOMPUTER
• CSG2D3 - BASIS DATA RELASIONAL
• CSG2H3 - PEMROGRAMAN BERORIENTASI OBJEK
• CSG3F3 - DESAIN DAN ANALISIS ALGORITMA
• IFG412 - TUGAS AKHIR I (SEMINAR PROPOSAL)
• IFG444 - TUGAS AKHIR II
• KUG1C3 - DASAR ALGORITMA DAN PEMROGRAMAN
• KUG1D1 - PRAKTIKUM DASAR ALGORITMA DAN PEMROGRAMAN
• MTH503 - METODOLOGI PENELITIAN
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• CCH1D4 - STRUKTUR DATA
• CCH3F3 - KECERDASAN BUATAN
• CCH4A3 - PENULISAN PROPOSAL
• CCH4D4 - TUGAS AKHIR
• CSH2D3 - SISTEM BASIS DATA
• CSH3K2 - METODOLOGI PENELITIAN
• CSH453 - BASIS DATA SPASIAL
• CSH4213 - BASIS DATA NON RELASIONAL
• IEH6A3 - SEMINAR
• ITH1G4 - ALGORITMA DAN STRUKTUR DATA
• CBH4J2 - SEMINAR PROPOSAL
• DPH1F4 - ALGORITMA DAN PEMROGRAMAN
• DPH1F4 - ALGORITMA DAN PEMROGRAMAN
• ISH1E3 - ALGORITMA DAN PEMROGRAMAN A
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• FEH1H3 - ALGORITMA DAN PEMROGRAMAN B
• DPH1B4 - ALGORITMA DAN PEMROGRAMAN KOMPUTER
• DCH1F4 - ALGORITMA DAN PEMROGRAMAN LANJUT
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• CCH1A4 - DASAR ALGORITMA DAN PEMROGRAMAN
• ISH1F1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN A
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• FEH1I1 - PRAKTIKUM ALGORITMA DAN PEMROGRAMAN B
• VSI1A4 - ALGORITMA DAN PEMROGRAMAN KOMPUTER
• VKI1E4 - ALGORITMA DAN PEMROGRAMAN
• VKI1J4 - ALGORITMA DAN PEMROGRAMAN LANJUT
• VAI1A4 - ALGORITMA DAN PEMROGRAMAN
• CII2B4 - STRUKTUR DATA
• CII2F3 - SISTEM BASIS DATA
• CII4A2 - PENULISAN PROPOSAL
• CII4E4 - TUGAS AKHIR
• IMI2A3 - SEMINAR
• CPI2B4 - STRUKTUR DATA
• III4A4 - TUGAS AKHIR
• TTI6C3 - METODOLOGI PENELITIAN
• CII9G6 - PROPOSAL PENELITIAN
• CII9A3 - FILSAFAT DAN METODOLOGI PENELITIAN

Koleksi & Sirkulasi

Tersedia 1 dari total 1 Koleksi

Pengarang

Penerbit

Sirkulasi

Download / Flippingbook