All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Searching of circular neighborhoods in the square and hexagonal regular grids

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/61989100:27740/17:10238693

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Searching of circular neighborhoods in the square and hexagonal regular grids

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

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

  • ISBN

    978-1-5386-2201-8

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    9

  • Pages from-to

    121-129

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Exeter

  • Event date

    Jun 21, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article