Indexing Voronoi Cell for Highest Order Voronoi Diagram using R-Tree
MUHAMMAD RAFI AL-FARIZI. S
Informasi Umum
Kode
18.04.614
Klasifikasi
C -
Jenis
Karya Ilmiah - Skripsi (S1) - Reference
Subjek
Data Processing-computer Science
Dilihat
128 kali
Informasi Lainnya
Abstraksi
Indexing (Index) is a way of grouping objects into a field. The use indexes help us in the search in the database, especially in a spatial database. Indexing can be implemented in a Voronoi diagram. Voronoi diagram has the disadvantage that the data object to the fragmentation (fractional part Voronoi diagram) can not be directly retrieved by the search data. This is due to the fragmentation of accessing difficult because it requires high computing. Therefore it is necessary a fast search process fragmentation, it is used \textit{Indexing}. One type \textit{Indexing} is R-Tree, R-Tree is a tree structure that does record at each leaf node. R-tree is suitable for use in indexing spatial data object that has a large size because the entire tree can not be stored in the main memory it can reduce the cost of I / O to almost negligible. R-Tree will build a Minimum Bounding Rectangle (MBR) of a point generator is made from the point of intersection of the line Voronoi builder.
- CSH453 - BASIS DATA SPASIAL
Koleksi & Sirkulasi
Seluruh 1 koleksi sedang dipinjam
Anda harus log in untuk mengakses flippingbook
Pengarang
| Nama | MUHAMMAD RAFI AL-FARIZI. S |
| Jenis | Perorangan |
| Penyunting | KIKI MAULANA ADHINUGRAHA, IBNU ASROR |
| 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 |
