The Hidden Face Determination Tree

Simple item page
dc.contributor.authorJames, A.en_US
dc.contributor.authorDay, A.M.en_US
dc.date.accessioned2015-11-11T13:10:06Z
dc.date.available2015-11-11T13:10:06Z
dc.date.issued1998en_US
dc.description.abstractHidden surface removal can be achieved using the Priority Face Determination (PFD) tree to create a priority ordering of n polygons in log4=3 n time. In this paper, we describe the Hidden Face Determi- nation (HFD) tree which is based upon the PFD tree. The HFD tree is constructed in a similar way as the PFD tree, but an addition means that polygons completely hidden by others in the scene can be determined at each node. Thus, not only does the HFD tree calculate the priority order of polygons in log4=3 n time, but determines which polygons are invisible from a given location.en_US
dc.description.seriesinformationEurographics 1998 - Short Papersen_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egs.19981006en_US
dc.publisherEurographics Associationen_US
dc.titleThe Hidden Face Determination Treeen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
james.pdf
Size:
95.88 KB
Format:
Adobe Portable Document Format
Download
Collections
Short Papers