| dc.contributor.advisor | Chandler, J. P. | |
| dc.contributor.author | Brown, Charles Wayne | |
| dc.date.accessioned | 2016-03-02T18:31:45Z | |
| dc.date.available | 2016-03-02T18:31:45Z | |
| dc.date.issued | 1980-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/32104 | |
| dc.description.abstract | The goal for this research was to develop an efficient hiddenline algorithm for a small computer system. A hidden-line algorithm published by J .. G. Griffith was used as a basis for the research. The algorithm was successfully implemented on a mini-computer and extensive analysis and testing were done. This work showed that Griffith's algorithm was a linear growth algorithm as �compared to the complexity of the picture environment. Several enhancements were added to theoriginal algorithm to achieve even greater efficiency. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Analysis of a Hidden-line Algorithm | |
| dc.type | text | |
| dc.contributor.committeeMember | Fisher, Donald | |
| dc.contributor.committeeMember | R. Phillips | |
| osu.filename | Thesis-1980-B877a.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Science | |
| dc.type.genre | Thesis | |
