DocumentCode
2173190
Title
A volume sorting hidden-surface algorithm
Author
Zhou, Xiaofeng ; Iskandar, Kristianto ; Staudhammer, John
Author_Institution
Dept. of Electr. Eng., Florida Univ., Gainesville, FL, USA
fYear
1989
fDate
20-22 Sep 1989
Firstpage
693
Lastpage
699
Abstract
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
Keywords
computational complexity; computerised picture processing; bounding volume technique; definitive drawing list; hierarchical structure; linear computational complexity; list-priority algorithm; volume sorting hidden-surface algorithm; Application software; Binary trees; Computer graphics; Hardware; Iterative algorithms; Particle separators; Rendering (computer graphics); Software algorithms; Solids; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location
Orlando, FL
Print_ISBN
0-8186-1964-3
Type
conf
DOI
10.1109/CMPSAC.1989.65167
Filename
65167
Link To Document