dc.contributor.authorKhin Maung Aye.en_US
dc.date.accessioned2008-10-20T08:18:20Z
dc.date.available2008-10-20T08:18:20Z
dc.date.copyright1999en_US
dc.date.issued1999en_US
dc.identifier.urihttp://hdl.handle.net/10356/13443
dc.description.abstractIn this dissertation, the author has made an attempt to study the performance characteristics of various convex hull algorithms currently available. By definition, the convex hull of a set of points in a plane is the smallest convex polygon containing all the given points. Many convex hull algorithms exist in the computational geometry field. Some algorithms work better under certain circumstances when others perform better with totally different conditions. Literature survey of computational geometry and convex hull algorithms were carried out during the study on the performance characteristics of these algorithms. Each algorithm was studied both from time complexity and space complexity point of views. Most of the convex hull algorithms are usually found in papers published in technical journals rather than in textbooks. They are presented in several different forms such as using flow chart, pseudo code, or just description by words. Notation used and area of concentration also varies from one article to another. Pseudo code form, however, is the most preferred, but not always available.en_US
dc.format.extent94 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexityen_US
dc.titleStudy on the performance characteristics of convex hull algorithmsen_US
dc.typeThesisen_US
dc.contributor.supervisorTor, Shu Bengen_US
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen_US
dc.description.degreeMSC(COMPUTER INTEGRATED MANUFACTURING)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record