1
An intersection algorithm for convex polyhedra | |
Author | Ratchadaporn Tickapunyakul |
Call Number | AIT Thesis no.CS-89-17 |
Subject(s) | Polyhedra--Models |
Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science |
Publisher | Asian Institute of Technology |
Abstract | The present thesis dealt with the constructive solid geometry (CSG) model in soli d modeling. Some important primitives were implemented to illustrate the data structure to enable building CSG trees. Particular emphasis was placed upon the investigation and implementation of an intersection algorithm, in which a new scheme was introduced to determine an interior point of the intersection of two convex polyhedra. Along with the above study, modifications were made to an existing 3D package to allow for solid modeling following the CSG approach. This will provide the basic tool for further research in solid modeling . |
Year | 1989 |
Type | Thesis |
School | School of Engineering and Technology (SET) |
Department | Department of Information and Communications Technologies (DICT) |
Academic Program/FoS | Computer Science (CS) |
Chairperson(s) | Huynh, Ngoc Phien;Bohez, Erik L.J.; |
Examination Committee(s) | Phan, Minh Dung; |
Scholarship Donor(s) | Thailand (King's); |
Degree | Thesis (M.Sc.) - Asian Institute of Technology, 1989 |