| dc.contributor.author | Adi, Soehadi | |
| dc.date.accessioned | 2014-12-08T16:55:31Z | |
| dc.date.available | 2014-12-08T16:55:31Z | |
| dc.date.issued | 1991-07-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/13650 | |
| dc.description.abstract | Triangulation of a simple polygon is an important part of the application of geometry problems in computer graphics. A conventional triangulation algorithm runs in O(n2). Faster tringulation methods have been developed but these methods are more complicated. A simpler triangulation method was developed by Fournier and Montuno, which runs in O(n log n). The modified triangulation algorithm presented here compares favorably with the Fournier and Montuno's triangulation algorithm and is simpler in the sense of elimination of recursion. The Fournier and Montuno's triangulation algorithm and the modified triangulation algorithm are implemented using c. The performance of the two algorithms is analyzed using various data. | |
| 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 | Modification of Fournier and Montuno's Triangulation Algorithm for Simple Polygons� | |
| dc.type | text | |
| osu.filename | Thesis-1991-A235m.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computer Science | |
| dc.type.genre | Thesis | |
