HVoR-Tree: Indexing Highest Order Voronoi Cells Using VoR-Tree
| Autor: | Sultan Alamri, Kiki Maulana Adhinugraha, Mohammed Aladalah, Daraswati Zakirah |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Regular polygon
020206 networking & telecommunications 02 engineering and technology Computer Science::Computational Geometry Data structure Tree (graph theory) k-nearest neighbors algorithm Combinatorics Polygon 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Point (geometry) Minimum bounding rectangle Voronoi diagram Mathematics |
| Zdroj: | 2019 8th International Conference on Modeling Simulation and Applied Optimization (ICMSAO). |
| DOI: | 10.1109/icmsao.2019.8880391 |
| Popis: | Index is a data structure to improve searching and minimizing effort to read the actual data. In spatial data structure, there are various objects can be considered, such as point, regular polygon, and irregular polygon. Irregular polygon is the shape of Voronoi Diagram which is used to divide a region into smaller regions based on its nearest neighbor. Voronoi Diagram has three orders, namely: (1) First Order Voronoi Diagram, (2) Higher Order Voronoi Diagram (HOVD), (3) Highest Order Voronoi Diagram (HSVD). Index uses Minimum Bounding Rectangle (MBR) in HSVD can cause high level of overlapping. The highest level of overlapping found in the HSVD, while the lowest is found in the First Order. VoR-tree (Voronoi R-Tree) is used to minimize overlapping. Previous studies used VoR-tree only to observed First Order Voronoi Diagram. This paper presents an index HVoR-Tree, which uses the VoR-tree structure effectively used in Highest Order Voronoi Diagram (HSVD). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|