A new algorithm for ray tracing object oriented environments is presented. The new algorithm promises significant savings in CPU time compared with the standard Constructive Solid Geometry (CSG) algorithm. In particular, fewer ray-surface intersections are calculated, all sorting is eliminated, and there is no binary tree traversal. The new algorithm is bounded in CPU cost by O(N) for N objects compared with O ( N 2 ) for CSG.
No takes yet. Share an insight, caveat, or question.
S. Youssef (1986) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: