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”

Nearest Neighbour Graph and Locally Minimal Triangulation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F17%3A43932181" target="_blank" >RIV/49777513:23520/17:43932181 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-62395-5_31" target="_blank" >http://dx.doi.org/10.1007/978-3-319-62395-5_31</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-62395-5_31" target="_blank" >10.1007/978-3-319-62395-5_31</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Nearest Neighbour Graph and Locally Minimal Triangulation

  • Original language description

    Nearest neighbour graph (NNG) is a useful tool namely for collision detection tests. It is well known that NNG, when considered as an undirected graph, is a subgraph of Delaunay triangulation and this relation can be used for efficient NNG computation. This paper concentrates on relation of NNG to the locally minimal triangulation (LMT) and shows that, although NNG can be proved not to be a LMT subgraph, in most cases LMT contains all or nearly all NNG edges. This fact can also be used for NNG computation, namely in kinetic problems, because LMT computation is easier.

  • 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

    Computational Science and Its Applications – ICCSA 2017, 17th International Conference, Trieste, Italy, July 3-6, 2017, Proceedings, Part II

  • ISBN

    978-3-319-62394-8

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    10

  • Pages from-to

    455-464

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Trieste

  • Event date

    Jul 3, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article