Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F04%3A00000237" target="_blank" >RIV/49777513:23520/04:00000237 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21230/04:00100103
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Practically oriented parallel Delaunay triangulation in E2 for computers with shared memory
Original language description
We describe two simple and efficient parallel algorithms for the construction of the Delaunay triangulation in E2. The proposed algorithms are designed for parallel systems several processors and with shared memory. We have implemented algorithms and tes
Czech name
Prakticky orientovaná paralelní Delaunayova triangulace v E2 pro počítače se sdílenou pamětí
Czech description
Tento článek popisuje dva jednoduché a efektivní paralelní algoritmy pro konstrukci Delauayovy triangulace v E2. Algoritmy jsou určen pro paralelní architektury s několika procesory a sdílenou pamětí. Navržené algoritmy byly naimplementovány a otestovýny
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
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
Name of the periodical
Computer & Graphics
ISSN
0097-8493
e-ISSN
—
Volume of the periodical
—
Issue of the periodical within the volume
—
Country of publishing house
GB - UNITED KINGDOM
Number of pages
16
Pages from-to
703-718
UT code for WoS article
—
EID of the result in the Scopus database
—