This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interactive Transparency Rendering for Large CAD Models
September/October 2005 (vol. 11 no. 5)
pp. 584-595
ASCII Text
x 
 
Jianbing Huang, Michael B. Carter, "Interactive Transparency Rendering for Large CAD Models," IEEE Transactions on Visualization and Computer Graphics, vol. 11, no. 5, pp. 584-595, September/October, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TVCG.2005.82,
author = {Jianbing Huang and Michael B. Carter},
title = {Interactive Transparency Rendering for Large CAD Models},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {11},
number = {5},
issn = {1077-2626},
year = {2005},
pages = {584-595},
doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2005.82},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - Interactive Transparency Rendering for Large CAD Models
IS - 5
SN - 1077-2626
SP584
EP595
EPD - 584-595
A1 - Jianbing Huang,
A1 - Michael B. Carter,
PY - 2005
KW - Index Terms- BSP
KW - depth sort
KW - transparency rendering
KW - triangle sorting.
VL - 11
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 
Transparency is an important graphics effect that can be used to significantly increase the realism of the rendered scene or to enable more effective visual inspection in engineering visualization. In this paper, we propose achieving interactive transparency rendering of a static scene by sorting the triangles in back-to-front order on CPU and supplying the sorted triangles to the graphics pipeline for rendering on GPU hardware. Our sorting method sorts the triangles in object space and is built upon the Binary Space Partition (BSP) and depth-sort methods with its behavior readily tunable to exploit the strengths of both methods. We propose novel techniques to optimize the BSP construction process with respect to multiple factors including tree construction time, tree size, and expected sorting cost. We also propose an improved depth-sort algorithm that can produce correct depth order without triangle split when no cyclic occlusion exists. We demonstrate that the proposed system results in a penalty factor of 4~6 for various types of parts, among which the largest one has nearly 1.2 million triangles. In addition, the penalty factor may be further improved if sorting in CPU and rendering in GPU are executed in parallel. Two approximation strategies are also studied to test the practicality of our system against large CAD assemblies. Experimental results on an assembly containing over 16 million triangles distributed in about 10,000 transparent parts show that the proposed system still results in a penalty factor of 4~6 while producing few artifacts.

[1] A. Mammen, “Transparency and Antialiasing Algorithms Implemented with the Virtual Pixel Maps Technique,” IEEE Computer Graphics and Applications, vol. 9, no. 4, pp. 43-55, July 1989.
[2] P. Diefenbach, “Pipeline Rendering: Interaction and Realism through Hardware-Based Multi-Pass Rendering,” PhD dissertation, Dept. of Computer Science, Univ. of Pennsylvania, 1996.
[3] M. Kelley, K. Gould, B. Pease, S. Winner, and A. Yen, “Hardware Accelerated Rendering of CSG and Transparency,” Proc. 21st Ann. Conf. Computer Graphics and Interactive Techniques, pp. 177-184, 1994.
[4] C. Everitt, “Interactive Order-Independent Transparency,” white paper, Nvidia, 2001.
[5] I.E. Sutherland, R.F. Sproull, and R.A. Schumacher, “A Characterization of Then Hidden-Surface Algorithms,” Computing Surveys, vol. 6, no. 1, Mar. 1974.
[6] H. Fuchs, Z.M. Kedem, and B.F. Naylor, “On Visible Surface Generation by A Priori Tree Structure,” Proc. Seventh Ann. Conf. Computer Graphics and Interactive Techniques, pp. 124-133, July 1980.
[7] H. Fuchs, G.D. Abram, and E.D. Grant, “Near Real-Time Shaded Display of Rigid Objects,” Computer Graphics, vol. 17, no. 3, July 1983.
[8] A. James, “Binary Space Partitioning for Accelerated Hidden Surface Removal and Rendering of Static Environments,” PhD dissertation, Univ. of East Anglia, Aug. 1999.
[9] M.E. Newell, R.G. Newell, and T.L. Sancha, “A Solution to the Hidden Surface Problem,” Proc. ACM Nat'l Conf., 1972.
[10] M. Deering, S. Winner, B. Schediwy, C. Duffy, and N. Hunt, “The Triangle Processor and Normal Vector Shader: A VLSI System for High Performance Graphics,” Proc. SIGGRAPH, pp. 21-30, 1988.
[11] D.E. Ellsworth, “Parallel Architecture and Algorithms for Real-Time Synthesis of High-Quality Images Using Deferred Shading,” Proc. Workshop Algorithms and Parallel VLSI Architectures, June 1990.
[12] J. Eyles, S. Molnar, J. Poulton, T. Greer, A. Lastra, N. England, and L. Westover, “PixelFlow: The Realization,” Proc. 1997 Siggraph/Eurographics Workshop Graphics Hardware, pp. 57-68, Aug. 1997.
[13] M. Deering, “Geometry Compression,” Proc. 22nd Ann. Conf. Computer Graphics and Interactive Techniques, Sept. 1995.
[14] N. Greene, M. Kass, and G. Miller, “Hierarchical Z-Buffer Visibility,” Proc. 20th Ann. Conf. Computer Graphics and Interactive Techniques, pp. 231-238, 1993.
[15] J.D. Foley, A. VanDam, S.K. Feiner, and J.F. Hughes, Computer Graphics: Principles and Practice, second ed. Addison-Wesley, 1997.

Index Terms:
Index Terms- BSP, depth sort, transparency rendering, triangle sorting.
Citation:
Jianbing Huang, Michael B. Carter, "Interactive Transparency Rendering for Large CAD Models," IEEE Transactions on Visualization and Computer Graphics, vol. 11, no. 5, pp. 584-595, Sept.-Oct. 2005, doi:10.1109/TVCG.2005.82
Usage of this product signifies your acceptance of the Terms of Use.