Title: Linear-time CSG rendering of intersected convex objects
Authors: Stewart, Nigel
Leach, Geoff
Sabu, John
Citation: Journal of WSCG. 2002, vol. 10, no. 1-2, p. 437-444.
Issue Date: 2002
Publisher: UNION Agency
Document type: článek
URI: http://wscg.zcu.cz/wscg2002/Papers_2002/B79.pdf
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: vektorové modelování geometrických objektů;vykreslovací algoritmy;OpenGL;modelování geometrických objektů
Keywords in different language: constructive solid geometry;rendering algorithms;solid modelling;OpenGL
Abstract: The Sequenced Convex Subtraction(SCS) algorithm is a hardware based multi-pass image-space lgorithm for general purpose Constructive Solid Geometry (CSG)Rendering. Convex objects combined by volumetric intersection, difference and union are rendered in real-time without b-rep re-processing. OpenGL stencil and depth testing is used to determine the visible surface for each pixel on the screen. This paper introduces a specialised algorithm for CSG Rendering of intersected convex objects,we call SCS-Intersect. This new technique requires linear time with respect to the number of intersections. SCS-Intersect is primarily of interest as an optimisation to the SCS algorithm for rendering CSG trees of convex objects. A revised formulation of the SCS CSG Rendering algorithm is presented in this pape.
Rights: © UNION Agency
Appears in Collections:Volume 10, number 1-2 (2002)

Files in This Item:
File Description SizeFormat 
B79.pdfPlný text615,88 kBAdobe PDFView/Open
B79-1.mpgVideo 12,79 MBMPEGView/Open
B79-2.mpgVideo 22,39 MBMPEGView/Open
B79-3.mpgVideo 32,98 MBMPEGView/Open
B79-4.mpgVideo 44,04 MBMPEGView/Open
B79-5.mpgVideo 51,61 MBMPEGView/Open
B79-6.mpgVideo 64,98 MBMPEGView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6010

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.