Highly Parallel Algorithm for Large Data In–Core and Out–Core Triangulation in E 2 and E 3 | Zendy

Michal Smolik | Zendy; Václav Skala | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Highly Parallel Algorithm for Large Data In–Core and Out–Core Triangulation in E 2 and E 3

Author(s) -

Michal Smolik,

Václav Skala

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.05.369

Subject(s) - delaunay triangulation , computer science , triangulation , bowyer–watson algorithm , minimum weight triangulation , pitteway triangulation , core (optical fiber) , constrained delaunay triangulation , out of core algorithm , algorithm , point set triangulation , multi core processor , parallel computing , mathematics , geometry , telecommunications

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 5 · 107 points),parallel methods are used for the purpose of decreasingrun–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. Experimental results proved that the resulting triangulation/tetrahedralization is close to the Delaunay triangulation/tetrahedralization. It also demonstrates the applicability of the methodproposed in applications

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research