Nigel Stewart
ABSTRACT
The Sequenced Convex Subtraction (SCS) algorithm for Constructive Solid Geometry (CSG) sequentially subtracts convex volumes from the z-buffer. The performance of the algorithm is determined by the length of the subtraction sequence used. View-independent subtraction sequences are O(n2) in length. These can be reduced to O(kn) if the maximum depth complexity k, which ranges between 1 and n, is known or can be determined.We present an improvement to subtraction sequence generation which uses object space overlap information to give O(n) length sequences in the best case and (unchanged) O(n2) sequences in the worst case. The approach is based on what we term an overlap graph. We also discuss a unifying approach combining overlap graph based processing with the Sequenced Convex Subtraction (SCS) CSG rendering algorithm. Finally, we present experimental results which show performance improvements, depending on the spatial arrangements of objects.
- COHEN, J., LIN, M., MANOCHA, D., AND PONAMGI, K. 1995. I-COLLIDE: An interactive and exact collision detection system for large-scaled environments. Proceedings of ACM Int. 3D Graphics Conference, 189-196. Google Scholar
Digital Library
- DIESTAL, R. 2000. Graph Theory. Sprinter-Verlag.Google Scholar
- EPSTEIN, D., JANSEN, F., AND ROSSIGNAC, J. 1989. Z-buffer rendering from CSG: The trickle algorithm. IBM Research Report RC 15182 (Nov).Google Scholar
- ERRA, R., LYGEROS, N., AND STEWART, N. 2001. On minimal strings containing the elements of Sn by decimation. Discrete Mathematics & Theoretical Computer Science AA, 165-176.Google Scholar
- GOLDFEATHER, J., HULTQUIST, J., AND FUCHS, H. 1986. Fast constructive solid geometry in the pixel-powers graphics system. In Computer Graphics (Proceedings of ACM SIGGRAPH 86), vol. 20(4), ACM, 107-116. Google ScholarDigital Library
- GOLDFEATHER, J., MOLNAR, S., TURK, G., AND FUCHS, H. 1989. Near real-time CSG rendering using tree normalization and geometric pruning. IEEE CG&A 9, 3 (May), 20-28. Google ScholarDigital Library
- JOSUTTIS, N. M. 1999. The C++ Standard Library. Addison Wesley. Google ScholarDigital Library
- KILGARD, M. J. 1996. The OpenGL Utility Toolkit (GLUT) Programming Interface.Google Scholar
- LOMBARDO, J.-C., CANI, M.-P., AND NEYRET, F. 1999. Real-time collision detection for virtual surgery. Proceedings of Computer Animation '99, 82-90. Google ScholarDigital Library
- SHREINER, D. 1999. OpenGL Reference Manual, 3rd ed. Addison Wesley. Google ScholarDigital Library
- STEWART, N., LEACH, G., AND JOHN, S. 1998. An improved Z-buffer CSG rendering algorithm. 1998 Eurographics/Siggraph Workshop on Graphics Hardware (Aug), 25-30. Google ScholarDigital Library
- STEWART, N., LEACH, G., AND JOHN, S. 2000. A Z-buffer CSG rendering algorithm for convex objects. The 8-th International Conference in Central Europe on Computer Graphics, Visualisation and Interactive Digital Media '2000 - WSCG 2000 II (Feb), 369-372. Google ScholarDigital Library
- STEWART, N., LEACH, G., AND JOHN, S. 2002. Linear-time CSG rendering of intersected convex objects. The 10-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision '2002 - WSCG 2002 II (Feb), 437-444.Google Scholar
- STROUSTRUP, B. 1997. The C++ Programming Language, 3rd ed. Addison Wesley. Google ScholarDigital Library
- WIEGAND, T. F. 1996. Interactive rendering of CSG models. Computer Graphics Forum 15, 4 (Oct), 249-261.Google ScholarCross Ref
- WOO, M., NADER, J., DAVIS, T., AND SHREINER, D. 1999. OpenGL Programming Guide, 3rd ed. Addison Wesley.Google Scholar
Index Terms
- Improved CSG rendering using overlap graph subtraction sequences
Recommendations
Hardware accelerated rendering of CSG and transparency
SIGGRAPH '94: Proceedings of the 21st annual conference on Computer graphics and interactive techniquesThis paper describes algorithms for implementing accurate rendering of CSG and transparency in a hardware 3D accelerator. The algorithms are based on a hardware architecture which performs front-to-back Z-sorted shading; a multiple-pass algorithm which ...
Fast Background Subtraction Using Improved GMM and Graph Cut
CISP '08: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04Background Subtraction is widely used to detect moving object from static background. In order to get good performance for practical application systems, the background subtraction method should not be too time and space consuming, and the accuracy is ...
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph
An i-triangulated graph is a graph in which every odd cycle has two non-crossing chords; i-triangulated graphs form a subfamily of perfect graphs. A slightly more general family of perfect graphs are clique-separable graphs. A graph is clique-separable ...
Comments