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”

Neighbourhood Graphs and Locally Minimal Triangulations

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F18%3A43954714" target="_blank" >RIV/49777513:23520/18:43954714 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-662-58039-4_7" target="_blank" >http://dx.doi.org/10.1007/978-3-662-58039-4_7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-662-58039-4_7" target="_blank" >10.1007/978-3-662-58039-4_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Neighbourhood Graphs and Locally Minimal Triangulations

  • Original language description

    Neighbourhood (or proximity) graphs, such as nearest neighbour graph, closest pairs, relative neighbourhood graph and k-nearest neighbour graph are useful tools in many tasks inspecting mutual relations, similarity and closeness of objects. Some of neighbourhood graphs are subsets of Delaunay triangulation (DT) and this relation can be used for efficient computation of these graphs. This paper concentrates on relation of neighbourhood graphs to the locally minimal triangulation (LMT) and shows that, although generally these graphs are not LMT subgraphs, in most cases LMT contains all or many edges of these graphs. This fact can also be used for the neighbourhood graphs 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

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • 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

    Transsaction on Computational Scieneced XXXIII

  • ISBN

    978-3-662-58038-7

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    13

  • Pages from-to

    115-127

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Trieste, Italy

  • Event date

    Jul 3, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article