Application of hexagonal coordinate systems for searching the K-NN in 2D space

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F16%3A86099065" target="_blank" >RIV/61989100:27240/16:86099065 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/16:86099065

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-28031-8_18" target="_blank" >http://dx.doi.org/10.1007/978-3-319-28031-8_18</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-28031-8_18" target="_blank" >10.1007/978-3-319-28031-8_18</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Application of hexagonal coordinate systems for searching the K-NN in 2D space

Popis výsledku v původním jazyce

Efficient searching of the k-nearest neighbors (k-NN) is a widely discussed problem. Most of the known 2D methods is based on division of a space to some quads or rectangular clusters. It is convenient for simple orthogonal querying of the space. However, a radius of neighbourhood is circular, thus the non complying quads have to be eliminated. This paper describes a novel approach of searching k-NN using hexagonal clustering of the 2D unordered point clouds. The hexagonal grid fully fills the 2D space as well. The shape of a hexagon is closer to the circular one and hexagonal coordinate systems are efficiently used to simply address the surrounding hexagons intersected by neighbourhood of a point. The paper contains performance tests of the proposed algorithm. (C) Springer International Publishing Switzerland 2016.

Název v anglickém jazyce

Application of hexagonal coordinate systems for searching the K-NN in 2D space

Popis výsledku anglicky

Efficient searching of the k-nearest neighbors (k-NN) is a widely discussed problem. Most of the known 2D methods is based on division of a space to some quads or rectangular clusters. It is convenient for simple orthogonal querying of the space. However, a radius of neighbourhood is circular, thus the non complying quads have to be eliminated. This paper describes a novel approach of searching k-NN using hexagonal clustering of the 2D unordered point clouds. The hexagonal grid fully fills the 2D space as well. The shape of a hexagon is closer to the circular one and hexagonal coordinate systems are efficiently used to simply address the surrounding hexagons intersected by neighbourhood of a point. The paper contains performance tests of the proposed algorithm. (C) Springer International Publishing Switzerland 2016.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: Centrum excelence IT4Innovations</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2016

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

Advances in Intelligent Systems and Computing. Volume 424

ISBN

978-3-319-28030-1

ISSN

2194-5357

e-ISSN

—

Počet stran výsledku

12

Strana od-do

209-220

Název nakladatele

Springer Verlag

Místo vydání

London

Místo konání akce

Kochi

Datum konání akce

16. 12. 2015

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

WRD - Celosvětová akce

Kód UT WoS článku

—