Title | ||
---|---|---|
Transparent visualization of large-scale and complex polygon meshes using a stochastic point-based rendering method. |
Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1145/2818517.2818528 | SIGGRAPH Asia Visualization in High Performance Computing |
Field | DocType | Citations |
Polygon,Polygon mesh,Computer graphics (images),Computer science,Visualization,Volume mesh,Rendering (computer graphics),Image resolution,Static mesh,Complex polygon | Conference | 1 |
PageRank | References | Authors |
0.36 | 2 | 7 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rui Xu | 1 | 23 | 4.30 |
Satoshi Tanaka | 2 | 61 | 20.61 |
Kyoko Hasegawa | 3 | 11 | 10.66 |
Wang Sheng | 4 | 1 | 0.36 |
Tomoko Tateyama | 5 | 50 | 10.67 |
Yen-Wei Chen | 6 | 720 | 155.73 |
Shoji Kido | 7 | 1 | 0.36 |