Answers are grounded in this paper and cite their sources.
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(n2), (where n is the number of primitives), an O(lcn) (where k is depth complexity) algorithm may be substituted. For cases where k is less than n this translates into a significant performance gain.
No takes yet. Share an insight, caveat, or question.
Stewart et al. (1998) studied this question.