1. UKM Learning and Research Repository
  2. Master Thesis / Tesis Master
  3. Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat
Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/476145
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorKhairuddin Omar, Prof Madya Dr.
dc.contributor.authorAli Mohammed Massud Mady (P49115)
dc.date.accessioned2023-10-06T09:14:01Z-
dc.date.available2023-10-06T09:14:01Z-
dc.date.issued2011-07-25
dc.identifier.otherukmvital:74593
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/476145-
dc.descriptionThe Voronoi Diagram (VD) is defined as a rediscovered mathematical concept from the 19th century. It is one of the most fundamental and useful constructions defined by irregular lattices. In this research, a comparative study of three VD algorithms is presented, and implemented on the thinning of Arabic handwriting. The objectives of this research are i) to study three construction algorithms of VD, which are the divideand- conquer algorithm, the half-plane intersection algorithm (as a static algorithm), and the incremental algorithm (as a dynamic algorithm); ii) to apply the three VD algorithms chosen above on thinning of Arabic handwriting; and iii) to compare the three algorithms of VD to find out the fastest and the best in construction. The three algorithms produced the final skeleton with the same number of points, but during the construction of VD, different number of vertices were obtained. Three stages were done in this research. The first stage includes edge detection, contour tracing, and sampling; whereas in the second stage, the VD is constructed using the three chosen algorithms. In the final stage, the medial axis is extracted by using the VD where vertices which are located within the text boundaries are kept and joined. The dataset used in this work consists of 569 handwritten Arabic binary images of Tunisian town names. By using the sampling interval R = 4, 481 generator points and 1362 vertices were obtained by using the divide-and-conquer algorithm, whereas 1401 vertices were obtained by the using half-plane intersection and incremental algorithms. The experimental results show that the divide-and-conquer algorithm was the fastest, while the incremental algorithm was the slowest.,Master/Sarjana
dc.language.isoeng
dc.publisherUKM, Bangi
dc.relationFaculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat
dc.rightsUKM
dc.subjectAlgorithms
dc.subjectVoronoi diagram construction
dc.subjectThinning
dc.subjectArabic handwriting
dc.subjectVoronoi polygons
dc.titleComparative study of algorithms for voronoi diagram construction on thinning of Arabic handwriting
dc.typetheses
dc.format.pages59
dc.identifier.callnoQA278.2.M33 2011
dc.identifier.barcode000772
Appears in Collections:Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Files in This Item:
File Description SizeFormat 
ukmvital_74593+Source01+Source010.PDF
  Restricted Access		1.79 MBAdobe PDFThumbnail
View/Open
Show simple item record Recommend this item


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.