Parallel delaunay triangulation in E2 and E3 for computers with shared memory

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F05%3A00000222" target="_blank" >RIV/49777513:23520/05:00000222 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21230/05:03108549

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Parallel delaunay triangulation in E2 and E3 for computers with shared memory

Original language description

This paper presents several parallel algorithms for the construction of the delaunay triangulation in E2 and E3. The proposed algorithms are designed for parallel systems with several processors and shared memory.

Czech name

Paralelní delaunoyova triangulace v E2 a v E3 pro počítače se sdílenou pamětí

Czech description

Tento článek popisuje několik paralelních algoritmů pro konstrukci delaunayovy triangulace v E2 a E3. Algoritmy jsou navrženy pro paralelní systémy s několika procesory a sdílenou pamětí.

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2005

Confidentiality

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

Name of the periodical

Parallel Computing

ISSN

0167-8191

e-ISSN

—

Volume of the periodical

31

Issue of the periodical within the volume

—

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

32

Pages from-to

491-522

UT code for WoS article

—

EID of the result in the Scopus database

—