DocumentCode
1444631
Title
Front-to-back display of BSP trees
Author
Gordon, Dan ; Chen, Shuhong
Author_Institution
Texas A&M Univ., College Station, TX, USA
Volume
11
Issue
5
fYear
1991
Firstpage
79
Lastpage
85
Abstract
A technique for displaying binary space partitioning (BSP) trees that is faster than the usual back-to-front display method is presented. By combining polygon scan-conversion with a dynamic screen data structure, the technique, a front-to-back approach, provides significant speedup in the display time of polygonal scenes that depend on BSP trees, especially in cases where the number of polygons is large. This speedup is confirmed by applying the technique to randomly generated triangles.<>
Keywords
computer graphics; trees (mathematics); BSP trees; binary space partitioning; display time; dynamic screen data structure; front-to-back display; polygon scan-conversion; polygonal scenes; randomly generated triangles; Aerospace simulation; Binary trees; Data structures; Equations; Image converters; Image generation; Large screen displays; Layout; Three dimensional displays; Tree data structures;
fLanguage
English
Journal_Title
Computer Graphics and Applications, IEEE
Publisher
ieee
ISSN
0272-1716
Type
jour
DOI
10.1109/38.90569
Filename
90569
Link To Document