Fast algorithm for triangular mesh scimplification based on vertex decimation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00000461" target="_blank" >RIV/49777513:23520/02:00000461 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fast algorithm for triangular mesh scimplification based on vertex decimation
Original language description
A common task in computer graphics is the visualisation of models of real world objects. These models are very large and complex and their surfaces are usually represented by triangular meshes.
Czech name
Rychlý algoritmus pro redukci trojúhelníkových sítí
Czech description
Častou úlohou v počítačové grafice a vizualizaci dat reprezentovaných trojúhelníkovými sítěmi je jejich redukce.
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
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
—
Issue of the periodical within the volume
—
Country of publishing house
DE - GERMANY
Number of pages
10
Pages from-to
42
UT code for WoS article
—
EID of the result in the Scopus database
—