CLC number: TP391.41
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 2
Clicked: 5152
QIN Ai-hong, XIONG Hua, PENG Hao-yu, LIU Zhen, SHI Jiao-ying. Cluster parallel rendering based on encoded mesh[J]. Journal of Zhejiang University Science A, 2006, 7(7): 1124-1133.
@article{title="Cluster parallel rendering based on encoded mesh",
author="QIN Ai-hong, XIONG Hua, PENG Hao-yu, LIU Zhen, SHI Jiao-ying",
journal="Journal of Zhejiang University Science A",
volume="7",
number="7",
pages="1124-1133",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A1124"
}
%0 Journal Article
%T Cluster parallel rendering based on encoded mesh
%A QIN Ai-hong
%A XIONG Hua
%A PENG Hao-yu
%A LIU Zhen
%A SHI Jiao-ying
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 7
%P 1124-1133
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A1124
TY - JOUR
T1 - Cluster parallel rendering based on encoded mesh
A1 - QIN Ai-hong
A1 - XIONG Hua
A1 - PENG Hao-yu
A1 - LIU Zhen
A1 - SHI Jiao-ying
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 7
SP - 1124
EP - 1133
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A1124
Abstract: Use of compressed mesh in rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compression scheme PRMC (rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering based Mesh Compression) supplying encoded meshes that can be partitioned and sorted in rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering system even in encoded-domain. First, we segment the mesh into submeshes and clip the submeshes’ boundary into Runs, and then piecewise compress the submeshes and Runs respectively. With the help of several auxiliary index tables, compressed submeshes and Runs can serve as rendering primitives in rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering system. Based on PRMC, we design and implement a rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering architecture. Compared with uncompressed representation, experimental results showed that PRMC meshes applied in cluster rendering%29&ck%5B%5D=abstract&ck%5B%5D=keyword'>parallel rendering system can dramatically reduce the communication requirement.
[1] Alliez, P., Desbrun, M., 2001. Progressive Encoding for Lossless Transmission of 3D Meshes. Proceeding of SIGGRAPH’01, p.198-205.
[2] Bernardini, F., Martin, I.M., Mittleman, J., Rushmeier, H., Taubin, G., 2002. Building a digital model of Michelangelo’s Florentine Pietà. IEEE Computer Graphics & Applications, 22(1):59-67.
[3] Cohen-or, D., Levin, D., Remez, O., 1999. Progressive Compression of Arbitrary Triangular Meshes. Visualization’99 Conference Proceedings, p.67-72.
[4] Correa, T.W., Klosowski, T.J., Silva, T.C., 2002. Out-of-Core Sort-First Parallel Rendering for Cluster-Based Tiled Displays. Proceedings of PGV 2002 4th Eurographics Workshop on Parallel Graphics and Visualization, p.89-96.
[5] Deering, M., 1995. Geometric Compression. Proceeding of SIGGRAPH’95, p.13-20.
[6] Gunhold, S., Strasser, W., 1998. Real Time Compression of Triangle Mesh Connectivity. Proceeding of SIGGRAPH’98, p.133-140.
[7] Ho, J., Lee, K., Kriegman, D., 2001. Compressing Large Polygonal Models. Visualization’01 Conference Proceedings, p.357-362.
[8] Hoppe, H., 1998. Smooth View-dependent Level-of-detail Control and its Application to Terrain Rendering. Visualization’98 Conference Proceedings, p.35-42.
[9] Isenburg, M., Alliez, P., 2002. Compressing Polygon Mesh Geometry with Parallelogram Prediction. Visualization’02 Conference Proceedings, p.141-146.
[10] Isenburg, M., Gumhold, S., 2003. Out-of-core Compression for Gigantic Polygon Meshes. ACM Trans. Graphics (SIGGRAPH’03), 22(3):935-942.
[11] Karypis, G., Kumar, V., 1998. METIS: Version 4 A Software Package for Partitioning Unstructured Graphs. University of Minnesota, http://glaros.dtc.umn.edu/gkhome/views/metis.
[12] Mitra, T., Chiueh, T., 2002. Compression-Domain Parallel Rendering. Proceedings of the International Parallel and Distributed Processing Symposium IPDPS’02.
[13] Molnar, S., Eyles, J., Poulton, J., 1992. PixelFlow: High-speed rendering using image composition. Computer Graphics (SIGGRAPH’92), 26(2):231-240.
[14] Mueller, C., 1995. The Sort-First Rendering Architecture for High-Performance Graphics. Proceedings of the ACM Symposium on Interactive 3D Graphics. Monterey, California, USA, p.75-84
[15] Pajarola, R., Rossignac, J., 2000. Compressed progressive meshes. IEEE Transactions on Visualization and Computer Graphics, 6(1):79-93.
[16] Samanta, R., Zheng, J., Funkhouser, T., Li, K., Singh, J.P., 1999. Load Balancing for Multi-projector Rendering Systems. SIGGRAPH/Eurographics Workshop on Graphics Hardware, p.107-116.
[17] Samanta, R., Funkhouser, T., Li, K., Singh, J.P., 2000a. Sort-first Parallel Rendering with a Cluster of PCs. SIGGRAPH’00 Technical Sketches, p.260.
[18] Samanta, R., Funkhouser, T., Singh, J.P., 2000b. Hybrid Sort-first and Sort-last Parallel Rendering with a Cluster of PCs. SIGGRAPH/Eurographics Workshop on Graphics Hardware, p.97-108.
[19] Samanta, R., Funkhouser, T., Li, K., 2001. Parallel Rendering with k-way Replication. Proceedings of the IEEE Symposium on Parallel and Large-Data Visualization and Graphics, p.75-84.
[20] Senburg, M., Snoeyink, J., 2000. Face Fixer: Compressing Polygon Meshes with Properties. Proc. SIGGRAPH’00, p.263-270.
[21] Szymczak, A., Rossignac, J., King, D., 2002. Piecewise regular meshes: construction and compression. Graphical Models, 64(3-4):183-198.
[22] Taubin, G., Rossignac, J., 1998. Geometric compression through topological surgery. ACM Transactions on Graphics, 17(2):84-115.
[23] Touma, C., Gotsman, C., 1998. Triangle Mesh Compression. Graphics Interface’98 Conference Proceedings, p.26-34.
Open peer comments: Debate/Discuss/Question/Opinion
<1>