| dc.contributor.author | James, A. | en_US |
| dc.contributor.author | Day, A.M. | en_US |
| dc.date.accessioned | 2015-11-11T13:10:06Z | |
| dc.date.available | 2015-11-11T13:10:06Z | |
| dc.date.issued | 1998 | en_US |
| dc.identifier.issn | 1017-4656 | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/egs.19981006 | en_US |
| dc.description.abstract | Hidden 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.publisher | Eurographics Association | en_US |
| dc.title | The Hidden Face Determination Tree | en_US |
| dc.description.seriesinformation | Eurographics 1998 - Short Papers | en_US |
