Optimistic parallel Delaunay triangulation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00073897" target="_blank" >RIV/49777513:23520/02:00073897 - isvavai.cz</a>
Alternative codes found
RIV/49777513:23520/02:00000195
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Optimistic parallel Delaunay triangulation
Original language description
The paper describes a new parallel algorithm of Delaunay triangulation based on randomized incremental insertion. The algorithm is practical, simple and can be modified also for constrained triangulation or tetrahedralization. It was developed for architectures with a lower degree of parallelism, such as several-processor workstations, and tested on up to 8 processors.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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
The Visual Computer
ISSN
01782789
e-ISSN
—
Volume of the periodical
Vol. 18
Issue of the periodical within the volume
č. 8
Country of publishing house
DE - GERMANY
Number of pages
19
Pages from-to
511
UT code for WoS article
—
EID of the result in the Scopus database
—