Title: Quadrilateral meshes stripification
Authors: Vaněček, Petr
Sviták, Radek
Kolingerová, Ivana
Skala, Václav
Citation: Algoritmy 2005: 17th Conference on Scientific Computing, Vysoké Tatry - Podbanské, Slovakia March 13 - 18, 2005: Proceedings of Contributed Papers and Posters, p. 300-308.
Issue Date: 2005
Publisher: Slovenská technická univerzita v Bratislavě
Document type: konferenční příspěvek
URI: http://hdl.handle.net/11025/11361
ISBN: 80-227-2192-1
Keywords: trojúhelníkové pásy;čytřúhelníky;vizualizace
Keywords in different language: triangle strips;quadrilaterals;visualization
Abstract: Quadrilateral models are becoming very popular in many applications of computer graphics (e.g. computer animation, computer games, scienti c visualization of volumetric data, etc.). The complexity of these models can be very high (even millions of quadrilaterals), thus the problem of fast visualization of these meshes is often being solved. To increase the speed one can use some techniques to avoid sending of unnecessary faces (e.g., visibility culling) or some kind of simpli cation of complex objects (e.g., (C)LOD). Still it is important to reduce the time needed to transmit the set of faces by compressing the topological information and decompressing at the rendering stage. One of popular approaches is to convert the quadrilateral mesh to the triangle mesh and render this mesh using strips of triangles. Using the strips, one can reduce the number of vertices sent to the rendering pipeline as two neighboring triangles in a strip share an edge and it is not necessary to send these vertices twice. In this paper we present a new triangle stripping algorithm, designed for quadrilateral meshes. As this algorithm searches for a strip of quadrilaterals and splits them in the nal stage it produces a high quality stripi cation.
Appears in Collections:Konferenční příspěvky / Conference Papers (KIV)

Files in This Item:
File Description SizeFormat 
Skala_2005_Quadrilateral-Meshes-Algoritmy.pdfPlný text215,73 kBAdobe PDFView/Open    Request a copy

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11361

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.