Open Collections

Hierarchical approaches to the hidden surface problem

University of British Columbia

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.

Text

2010-04-20

For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.

http://hdl.handle.net/2429/23927

Computer Science

University of British Columbia

Graduate