Informasi Umum

Kode

18.04.657

Klasifikasi

C -

Jenis

Karya Ilmiah - Skripsi (S1) - Reference

Subjek

Computer Science

Dilihat

231 kali

Informasi Lainnya

Abstraksi

Nearest neighbor is one of the most common spatial database queries. The query has been implemented in outdoor space to find the nearest object of interests from query location. While nearest neighbor queries are commonly used in outdoor, it is hard to be implemented in indoor space due to lack of geo-positioning system that can be used in indoor space. Moreover, the network structure and the objects of interest types in indoor environment make nearest neighbor query difficult to implemented straight away in indoor environment. This paper adapts nearest neighbor in indoor space for inter-building environment without geo-positioning and discover the shortest path to nearest object. Our experiment show that nearest neighbor could be adapted in indoor spaces by using road network in indoor and implement routing algorithm for routing to the nearest object.

Keyword : Nearest neighbor, indoor space.

  • CSH453 - BASIS DATA SPASIAL
  • MUG2A3 - MATEMATIKA DISKRIT
  • IFG444 - TUGAS AKHIR II

Koleksi & Sirkulasi

Seluruh 1 koleksi sedang dipinjam

Anda harus log in untuk mengakses flippingbook

Pengarang

Nama DISKA ANDINI
Jenis Perorangan
Penyunting KIKI MAULANA ADHINUGRAHA, SULTAN ALAMRI
Penerjemah

Penerbit

Nama Universitas Telkom, S1 Teknik Informatika
Kota Bandung
Tahun 2018

Sirkulasi

Harga sewa IDR 0,00
Denda harian IDR 0,00
Jenis Non-Sirkulasi