A volume sorting hidden-surface algorithm

A description is given of a volume sorting hidden-surface removal algorithm that is analogous to the list-priority algorithm but computes the definitive drawing list for volumetric objects rather than for polygons. The algorithm is implemented by using a bounding volume technique that simplifies the volume sorting. Bounding volumes can be further organized into a hierarchical structure to achieve a linear computational complexity.<>