Sciweavers

306 search results - page 6 / 62
» Decimation of triangle meshes
Sort
View
CAD
2000
Springer
13 years 7 months ago
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
Jihad El-Sana, Francine Evans, Aravind Kalaiah, Am...
SMA
2009
ACM
125views Solid Modeling» more  SMA 2009»
14 years 1 months ago
Stable mesh decimation
Current mesh reduction techniques, while numerous, all primarily reduce mesh size by successive element deletion (e.g. edge collapses) with the goal of geometric and topological f...
Chandrajit L. Bajaj, Andrew Gillette, Qin Zhang
3DPVT
2002
IEEE
112views Visualization» more  3DPVT 2002»
14 years 2 days ago
Optimized Compression of Triangle Mesh Geometry Using Prediction Trees
Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to ...
Boris Kronrod, Craig Gotsman
PG
2002
IEEE
14 years 23 hour ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...