University of British Columbia
An algorithm for polyhedron modelling and its implementation
Abstract
dc:descriptionThis thesis describes an algorithm for calculating the theoretic set operations union, intersection, and difference of two polyhedra. The polyhedra are in the Eulerian surface description format, specified by their vertices, edges, and faces. The representation of polyhedra is based on the unambiguous Boundary Representation scheme. The domain of this algorithm includes all flat-surfaced polyhedra; however, nested holes and curved surfaces are not permitted. The thesis is divided into three parts. The first part presents some mathematical definitions and the representation scheme for polygons and polyhedra. Since there are many similarities between 2-D polygon modelling and 3-D polyhedron modelling, the 2-D polygon modelling algorithm is presented next, followed by the 3-D polyhedron modelling algorithm.
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
- 1984
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Yeung, Kwai-Biu Ricky
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/24800