Searching of circular neighborhoods in the square and hexagonal regular grids

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10238693" target="_blank" >RIV/61989100:27240/17:10238693 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/17:10238693

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-48499-0_15" target="_blank" >http://dx.doi.org/10.1007/978-3-319-48499-0_15</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-48499-0_15" target="_blank" >10.1007/978-3-319-48499-0_15</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Searching of circular neighborhoods in the square and hexagonal regular grids

Popis výsledku v původním jazyce

The nearest neighbors (NN) algorithm is a traditional algorithm utilized in many research areas like computer graphics, classification and/or machine learning. This paper aims at the fixed-radius nearest neighbors algorithm in 2D space. The neighbors are searched within a circular neighborhood which is positioned in the bounded space. The radius of the circle is known in advance. The uniform grids can be efficiently utilized for a nearest points query acceleration. This paper presents a study comparing the square and the hexagonal uniform grids and their suitability for a circular neighborhood querying. The two algorithms checking the mutual position/intersection of a circle and a square or a hexagon are described. The tests show the supremacy of the hexagonal grid.

Název v anglickém jazyce

Searching of circular neighborhoods in the square and hexagonal regular grids

Popis výsledku anglicky

The nearest neighbors (NN) algorithm is a traditional algorithm utilized in many research areas like computer graphics, classification and/or machine learning. This paper aims at the fixed-radius nearest neighbors algorithm in 2D space. The neighbors are searched within a circular neighborhood which is positioned in the bounded space. The radius of the circle is known in advance. The uniform grids can be efficiently utilized for a nearest points query acceleration. This paper presents a study comparing the square and the hexagonal uniform grids and their suitability for a circular neighborhood querying. The two algorithms checking the mutual position/intersection of a circle and a square or a hexagon are described. The tests show the supremacy of the hexagonal grid.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

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

2017 3rd IEEE International Conference on Cybernetics, CYBCONF 2017 - Proceedings

ISBN

978-1-5386-2201-8

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

9

Strana od-do

121-129

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Exeter

Datum konání akce

21. 6. 2017

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

WRD - Celosvětová akce

Kód UT WoS článku

—