Fast algorithm for triangular mesh simplification 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%3A00071305" target="_blank" >RIV/49777513:23520/02:00071305 - 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 simplification 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. The surface of complex model can contain thousands or even million of triangles. Becaus we want fast and interactive manipulation with these models, we need either to improve our graphics hardware or to find a method how to reduce the number of triangles in the mesh, e. g. mesh simplification. In this paper we will present a fast algorithm for triangular mesh reduction based on the principle of vertx decimation.
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
Fast algorithm for triangular mesh simplification based on vertex decimation
ISBN
—
ISSN
—
e-ISSN
—
Number of pages
1
Pages from-to
—
Publisher name
Neuveden
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
—