Abstract
dc:descriptionA 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 1982
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dadoun, Norm
Rights
dc:rights- Statement dc:rights
-
- 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.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/23927