Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
PixelFlow: high-speed rendering using image composition
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
The sort-first rendering architecture for high-performance graphics
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A breadth-first approach to efficient mesh traversal
HWWS '98 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Mesh compression and its hardware/software applications
Mesh compression and its hardware/software applications
Hi-index | 0.00 |
Three dimensional triangle mesh is the dominant representation used in parallel rendering of 3D geometric models. However, explosive growth in the complexity of the mesh-based 3D models overwhelms the communication bandwidth of existing parallel rendering systems. An effective solution to this problem is to use a compressed mesh representation. In recent years, researchers have shown a great deal of interest in developing highly efficient mesh compression algorithms. However, using compressed mesh in the parallel rendering architecture to achieve highest end-to-end performance is a largely unexplored area. We have earlier developed an efficient mesh compression/ decompression algorithm, called Breadth First Traversal (BFT) [3, 4]. In this work, we design and implement a parallel rendering architecture that can use a BFT mesh representation. The enabling technology is a novel algorithm that can perform a compression-domain subdivision of the BFT mesh for bandwidth-efficient distribution of submeshes to parallel processors. Parallel rendering using BFT mesh reduces the communication requirement to about one third of that of uncompressed representation.