A Hybrid Point Indexing Structure Based on Orthogonal and Hexagonal Grids

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10242619" target="_blank" >RIV/61989100:27240/19:10242619 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/doi/pdf/10.1145/3307363.3307407?download=true" target="_blank" >https://dl.acm.org/doi/pdf/10.1145/3307363.3307407?download=true</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3307363.3307407" target="_blank" >10.1145/3307363.3307407</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A Hybrid Point Indexing Structure Based on Orthogonal and Hexagonal Grids

Popis výsledku v původním jazyce

Multidimensional point indexing is an important task in many scientific areas such as computer graphics, image processing, geographic information systems, machine learning and pattern recognition. This paper proposes a novel 2D structure for efficient Fixed-Radius Nearest Neighbors queries. The standard methods are based on the recursive passage of a spatial tree or direct addressing of uniform grid cells with constant size. Each method is good for different type of data. Our algorithm uses space-filling curves to combine the principles of linear uniform grids and hierarchical recursion. Most of the preferred methods are based on the orthogonal grids. We introduce a novel hexagonal hierarchical structure and provide a comparison of both approaches.

Název v anglickém jazyce

A Hybrid Point Indexing Structure Based on Orthogonal and Hexagonal Grids

Popis výsledku anglicky

Multidimensional point indexing is an important task in many scientific areas such as computer graphics, image processing, geographic information systems, machine learning and pattern recognition. This paper proposes a novel 2D structure for efficient Fixed-Radius Nearest Neighbors queries. The standard methods are based on the recursive passage of a spatial tree or direct addressing of uniform grid cells with constant size. Each method is good for different type of data. Our algorithm uses space-filling curves to combine the principles of linear uniform grids and hierarchical recursion. Most of the preferred methods are based on the orthogonal grids. We introduce a novel hexagonal hierarchical structure and provide a comparison of both approaches.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

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ů

Název statě ve sborníku

Proceedings of the 11th International Conference on Computer Modeling and Simulation

ISBN

978-1-4503-6619-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

151-156

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Melbourne

Datum konání akce

16. 1. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000470870700027