Parallel delaunay triangulation in 2D and 3D
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00070845" target="_blank" >RIV/49777513:23520/02:00070845 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parallel delaunay triangulation in 2D and 3D
Original language description
At present, there is a lack of parallel algorithms for workstations with shared memory and several pr ocessors. Our goal was to design a new parallel algorithm,simple and efficient enough to be an attractive choice in competition with long.existing serial algorithms. This paper summarizes the proposed methods.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
Article name in the collection
Parallel delaunay triangulation in 2D and 3D
ISBN
3854031637
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
143
Publisher name
Österreichische Computer GesellschaftWien
Place of publication
Neuveden
Event location
Neuveden
Event date
Jan 1, 2002
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—