An improved z-buffer CSG rendering algorithm

Abstract

We present an improved z-buffer based CSG rendering algorithm, based on previous techniques using z-buffer parity based surface clipping. We show that while this type of algorithm has been reported as requiring O(

Mechanistic modelling of the milling process using an adaptive depth buffer

“…Some attempts have been made in the literature to use computer graphics hardware to render CSG trees and implement boolean operations in image-space (i.e. view dependent) [19].…”

Hardware-assisted Rendering of CSG Models

“…Rappoport [10] converts the CSG representation to a CDA representation and then uses the stencil buffer to render at interactive rates. Stewart et al [13] improved upon Goldfeather's algorithm and then introduced the SCS algorithm [14], an improvement upon [13] and later refined it [15]. Erhart and Tobbler [3], Guha et al [6] and Kirsch and Dollner [9] implemented optimizations over either the SCS, the Goldfeather or the layered Goldfeather algorithms to better use newer graphics hardware.…”

Improved CSG rendering using overlap graph subtraction sequences

“…These encoding algorithms have been described previously [Stewart et al 2000;Erra et al 2001;Stewart et al 2002].…”

“…Finally, we present experimental results which show performance improvements, depending on the spatial arrangements of objects. The Sequenced Convex Subtraction (SCS) algorithm [Stewart et al 2000;Stewart et al 2002] is an image-space approach to CSG rendering. The algorithm utilises an Or n s algorithm for intersection of convex objects and an Or n 2 s algorithm for subtraction of convex objects [Stewart et al 2002].…”

“…Previous image-space CSG rendering algorithms [Epstein et al 1989;Goldfeather et al 1989;Wiegand 1996] rely on multiple z-buffers, extended z-testing or zbuffer copying. The SCS algorithm aims to maximise performance by increased utilisation of high-performance polygon rasterisation, which is typically a fast path, rather than z-buffer copying, which is typically a slow path [Wiegand 1996;Stewart et al 1998;Stewart et al 2000]. …”