Parallel triangular mesh decimation without sorting
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00065264" target="_blank" >RIV/49777513:23520/01:00065264 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parallel triangular mesh decimation without sorting
Original language description
A fast algorithm for triangular mesh reduction based on the principle of mesh decimation is presented here. We propose a fast and stable algorithm for triangular mesh simplification in parallel environment. A method used is based on our original super independent set of vertices.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA2030801" target="_blank" >IAA2030801: Parallelization of computer processing</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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 triangular mesh decimation without sorting
ISBN
0769512151
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Los Alamitos
Event date
Jan 1, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—