DocumentCode
2706819
Title
TetStreamer: compressed back-to-front transmission of Delaunay tetrahedra meshes
Author
Bischoff, Urs ; Rossignac, Jarek
Author_Institution
Georgia Inst. of Technol., Atlanta, GA, USA
fYear
2005
fDate
29-31 March 2005
Firstpage
93
Lastpage
102
Abstract
We use the abbreviations tet and tri for tetrahedron and triangle. TetStreamer encodes a Delaunay tet mesh in a back-to-front visibility order and streams it from a server to a client (volumetric visualizer). During decompression, the server performs the view-dependent back-to-front sorting of the tets by identifying and deactivating one free tet at a time. A tet is free when all its back faces are on the sheet. The sheet is a tri mesh separating active and inactive tets. It is initialized with the back-facing boundary of the mesh. It is compressed using EdgeBreaker and transmitted first. It is maintained by both the server and the client and advanced towards the viewer passing one free tet at a time. The client receives a compressed bit stream indicating where to attach free tets to the sheet. It renders each free tet and updates the sheet by either flipping a concave edge, removing a concave valence-3 vertex, or inserting a new vertex to split a tri. TetStreamer compresses the connectivity of the whole let mesh to an average of about 1.7 bits per tet. The footprint (in-core memory required by the client) needs only to hold the evolving sheet, which is a small fraction of the storage that would be required by the entire tet-mesh. Hence, TetStreamer permits us to receive, decompress, and visualize or process very large meshes on clients with a small in-core memory. Furthermore, it permits us to use volumetric visualization techniques, which require that the mesh be processed in view-dependent back-to-front order, at no extra memory, performance or transmission cost.
Keywords
client-server systems; data compression; data visualisation; mesh generation; rendering (computer graphics); Delaunay tetrahedra meshes; EdgeBreaker; TetStreamer; back-to-front visibility; client server system; compressed back-to-front transmission; concave edge flipping; concave valence-3 vertex; decompression; footprint; view-dependent back-to-front sorting; visualization; volumetric visualizer; Art; Back; Costs; Data compression; Data structures; Data visualization; Decoding; Hardware; Interpolation; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2005. Proceedings. DCC 2005
ISSN
1068-0314
Print_ISBN
0-7695-2309-9
Type
conf
DOI
10.1109/DCC.2005.85
Filename
1402170
Link To Document