TY - GEN
T1 - Transparent visualization of large-scale and complex polygon meshes using a stochastic point-based rendering method
AU - Xu, Rui
AU - Tanaka, Satoshi
AU - Hasegawa, Kyoko
AU - Sheng, Wang
AU - Tateyama, Tomoko
AU - Chen, Yen Wei
AU - Kido, Shoji
PY - 2015/11/2
Y1 - 2015/11/2
N2 - Efficient and reliable transparent visualization of large and complex surface data is important in many applications, including the visualization of medical data. Among the many methods, depth-peeling is an efficient solution for rendering polygon meshes transparently; however, the computational cost is related to the number of passes through the peeled geometry. Therefore, the depth-peeling method cannot efficiently render large and complex polygon meshes that require many passes through the geometry. In this paper, we solve this problem using a stochastic point-based rendering (SPBR) method. We use two types of large-scale and complex polygon meshes that have 5,744,376 and 4,800,644 triangles in the experiments. The rendering speed of our method is 3-5 times faster than that of the depth-peeling method for an image resolution of 512 × 512. Additionally, the SPBR method has an inherent visual effect: the outlines of target polygon meshes can be automatically enhanced. This makes the results of the SPBR method more vivid and comprehensible than those of the depth-peeling method.
AB - Efficient and reliable transparent visualization of large and complex surface data is important in many applications, including the visualization of medical data. Among the many methods, depth-peeling is an efficient solution for rendering polygon meshes transparently; however, the computational cost is related to the number of passes through the peeled geometry. Therefore, the depth-peeling method cannot efficiently render large and complex polygon meshes that require many passes through the geometry. In this paper, we solve this problem using a stochastic point-based rendering (SPBR) method. We use two types of large-scale and complex polygon meshes that have 5,744,376 and 4,800,644 triangles in the experiments. The rendering speed of our method is 3-5 times faster than that of the depth-peeling method for an image resolution of 512 × 512. Additionally, the SPBR method has an inherent visual effect: the outlines of target polygon meshes can be automatically enhanced. This makes the results of the SPBR method more vivid and comprehensible than those of the depth-peeling method.
UR - http://www.scopus.com/inward/record.url?scp=84959576230&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84959576230&partnerID=8YFLogxK
U2 - 10.1145/2818517.2818528
DO - 10.1145/2818517.2818528
M3 - Conference contribution
AN - SCOPUS:84959576230
T3 - SIGGRAPH Asia 2015 Visualization in High Performance Computing, SA 2015
BT - SIGGRAPH Asia 2015 Visualization in High Performance Computing, SA 2015
PB - Association for Computing Machinery, Inc
T2 - SIGGRAPH Asia, SA 2015
Y2 - 2 November 2015 through 6 November 2015
ER -