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”

Highly Parallel Algorithm for Large Data In-Core and Out-Core Triangulation in E2 and E3

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43926358" target="_blank" >RIV/49777513:23520/15:43926358 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.procs.2015.05.369" target="_blank" >http://dx.doi.org/10.1016/j.procs.2015.05.369</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.procs.2015.05.369" target="_blank" >10.1016/j.procs.2015.05.369</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Highly Parallel Algorithm for Large Data In-Core and Out-Core Triangulation in E2 and E3

  • Original language description

    A triangulation of points in E2, or a tetrahedronization of points in E3, is used in many applications. It is not necessary to fulfill the Delaunay criteria in all cases. For large data (more then 5BULLET OPERATOR10^7 points), parallel methods are used for the purpose of decreasing run time. A new approach for fast, effective and highly parallel CPU and GPU triangulation, or tetrahedronization, of large data sets in E2 or E3 suitable for in core and out core memory processing, is proposed. Experimentalresults proved that the resulting triangulation/tetrahedralization is close to the Delaunay triangulation/tetrahedralization. It also demonstrates the applicability of the method proposed in applications.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/LH12181" target="_blank" >LH12181: Development of Algorithms for Computer Graphics and CAD/CAM systems</a><br>

  • Continuities

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

Others

  • Publication year

    2015

  • 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

    Procedia Computer Science International Conference On Computational Science, ICCS 2015 Computational Science at the Gates of Nature

  • ISBN

  • ISSN

    1877-0509

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    2613-2622

  • Publisher name

    Elsevier

  • Place of publication

    London

  • Event location

    Reykjavík, Iceland

  • Event date

    Jun 1, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article