Proposal of Effective Orthogonal and Hexagonal Hierarchical Structures for Disc Queries
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10242620" target="_blank" >RIV/61989100:27240/18:10242620 - isvavai.cz</a>
Výsledek na webu
<a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8779924" target="_blank" >https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8779924</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/CRC.2018.00013" target="_blank" >10.1109/CRC.2018.00013</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Proposal of Effective Orthogonal and Hexagonal Hierarchical Structures for Disc Queries
Popis výsledku v původním jazyce
The Fixed-Radius Nearest Neighbors (FRNN) query is a common task in scientific areas dealing with multidimensional point clouds (PCs) such as computer graphics, image processing, geographic information systems, machine learning and pattern recognition. We especially focus on 2D points in this paper. The FRNN means search all the points within defined radius for tasks when local properties of data are crucial. As this procedure is time consuming, an effective accelerating structure indexing the points is required. The standard methods are based on the orthogonal grids subdividing the space into uniform cells or hierarchies of orthogonal grids. However, several papers highlight the regular hexagonal grids for their superior theoretical metrics, e.g. better coverage of query discs, uniform distance to all six neighbors or lower number of passed cells. This paper provides a comparison of effectiveness of orthogonal and hexagonal hierarchies and traditional algorithms for FRNN disc queries. To do this, we propose a novel hierarchical method based on the hexagonal space-filling curve called the Node-Gosper curve which defines the hierarchical location of points in the hexagonal grids and their linear order. This method is tested with similar structure based on the orthogonal Z-order curve to show the real features of both approaches in practice. (C) 2018 IEEE.
Název v anglickém jazyce
Proposal of Effective Orthogonal and Hexagonal Hierarchical Structures for Disc Queries
Popis výsledku anglicky
The Fixed-Radius Nearest Neighbors (FRNN) query is a common task in scientific areas dealing with multidimensional point clouds (PCs) such as computer graphics, image processing, geographic information systems, machine learning and pattern recognition. We especially focus on 2D points in this paper. The FRNN means search all the points within defined radius for tasks when local properties of data are crucial. As this procedure is time consuming, an effective accelerating structure indexing the points is required. The standard methods are based on the orthogonal grids subdividing the space into uniform cells or hierarchies of orthogonal grids. However, several papers highlight the regular hexagonal grids for their superior theoretical metrics, e.g. better coverage of query discs, uniform distance to all six neighbors or lower number of passed cells. This paper provides a comparison of effectiveness of orthogonal and hexagonal hierarchies and traditional algorithms for FRNN disc queries. To do this, we propose a novel hierarchical method based on the hexagonal space-filling curve called the Node-Gosper curve which defines the hierarchical location of points in the hexagonal grids and their linear order. This method is tested with similar structure based on the orthogonal Z-order curve to show the real features of both approaches in practice. (C) 2018 IEEE.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10200 - Computer and information sciences
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2018
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Proceedings - 2018 3rd International Conference on Control, Robotics and Cybernetics, CRC 2018
ISBN
978-1-5386-7738-4
ISSN
—
e-ISSN
—
Počet stran výsledku
7
Strana od-do
20-26
Název nakladatele
IEEE
Místo vydání
Piscataway
Místo konání akce
Penang
Datum konání akce
26. 9. 2018
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—