The hidden face determination tree

James, A. and Day, A. M. (1999) The hidden face determination tree. Computers & Graphics, 23 (3). pp. 377-387. ISSN 0097-8493

Full text not available from this repository. (Request a copy)

Abstract

Hidden surface removal can be achieved using the priority face determination (PFD) tree to create a priority ordering of n polygons in log4/3n time. In this paper, we show how the number of polygons stored in the tree and drawn to the screen can be minimized significantly by determining, at the pre-processing stage, which polygons are completely hidden by other polygons from particular regions of the scene. The removal of hidden polygons at the pre-processing stage means that there is no need to even consider them at run time. The cost for the resulting decrease in run time is an increase in the pre-processing time, but techniques for reducing this are presented.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computer Graphics (former - to 2018) Faculty of Science > Research Groups > Interactive Graphics and Audio
Depositing User:	Vishal Gautam
Date Deposited:	28 Feb 2011 10:07
Last Modified:	24 Sep 2024 10:29
URI:	https://ueaeprints.uea.ac.uk/id/eprint/21706
DOI:	10.1016/S0097-8493(99)00046-1

Actions (login required)

View Item