UBC Theses and Dissertations
Hierarchical approaches to the hidden surface problem Dadoun, Norm
A general method for performing hidden line/surface elimination in complex domains is presented. This method uses a preprocessed hierarchical organization of the environment features. Convex polyhedra are used as elements of this hierarchy. Each polyhedron forms a convex approximation of the environment features which it contains. This hierarchy is used to provide efficient algorithms for solving the intersection, sorting and clipping subproblems associated with the hidden line/surface problem. Methods for constructing and using this hierarchy are discussed. Recent results from computational geometry are applied to element construction and intersection processing.
Item Citations and Data