Australian Journal of Basic and Applied Sciences, 5(11): 1653-1667, 2011 ISSN 1991-8178 Corresponding Author: Jabril Ramdan, School of Computer Science, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, 43200 Bangi, Selangor, Malaysia, Center of Artificial Intelligent. E-mail: Jibrel.ambark@gmail.com 1653 Comparative Study of Algorithms for Voronoi Diagram Construction on Segmentation of Arabic Hand Writing Jabril Ramdan and Khairuddin Omar School of Computer Science, Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, 43200 Bangi, Selangor, Malaysia, Center of Artificial Intelligent. Abstract: Segmenting Arabic characters is one of the challenging and tedious tasks in the character recognition process. This work proposes an approach to construct Arabic characters segmentation based on Voronoi area. The proposed approach is constructed based on four existing algorithms, such as Voronoi Diagrams (VD), Divided-and-Conquer algorithm (DAC), Half Plane Intersection algorithm (HPI) and Incremental algorithm (I). The VD method performs the segmentation processes by obtaining extracting the line between the connected components, based on the neighbours graph. Whereas the DAC is a fundamental paradigm used for designing efficient algorithms, where the original problem is recursively divided into several simpler sub-problems of approximately equal size. Thenthen the solution of the original problem will be obtained, by merging the solutions of the sub- problems. The HPI algorithm is based on Delauney Triangulation. The VD is constructed by HPI algorithm as follows: i): Connect connect Nearest nearest neighbors and; ii): draw the perpendicular bisector for each Delauney line. Meanwhile, the ‘I’ algorithm calculates the VD by incremental insertion of Voronoi regions, which makes it more efficient and numerically robust to produce the best structures and yield better results in the segmentation process. The proposed algorithm determines the neighbours graph by drawing a line from the centre of the connected components to trace the boundaries of the neighbours in a white background. If there is a gap between the connected components, then they are not considered as neighbours. The Euclidian distance is used as a base to draw line segment between the connected components, which is called as VD. In this research the IFN/ENIT1 dataset will be used. This dataset consists of 569 handwritten Arabic images of the Tunisian towns' names namesof Tunisian towns'. Several experiments has been carried out with the above mentioned base algorithms and compared in terms oftime,speed ofconstruction,the number ofvertices,and edges. The early results shows that in the static algorithm category, the performance of DAC is promising than the HPI in the static algorithm category, whereas the dynamic I algorithm consumes more time than static algorithms. Key words: Voronoi Diagram, VD Segmentation, Handwritten word, OCR, neighbours, connected component. INTRODUCTION Voronoi Diagram (VD) is one of the finest innovations in the field of mathematics in the 19 th centuryThe 19 th century witnessed a technical innovation in mathematics in the form of . Voronoi Diagrams (VD). The VD is the fundamental and essential structure arbitrated by the non-statutory schemes. The number of lines isolating the central point, and the points of its neighbours are represented by the VD. In addition, the dividing lines and lines of communication are a pinnacle to one another (Zeki, 2006), (Shatnawi and Omar, 2009). The basic Voronoi concept involves tessellating an m-dimensional space with respect to a finite set of objects by assigning all locations in the space to the closest member of the object set (Barry Boots1 et. al., 2005). The VD is capable of creating a negligible, yet absolute amount of neighbours of an element, which means that only the nearest elements are obtained. The VD of a group of geometric objects is a divider of space from cells. Each of which comprises all the points nearer to a specific object than others. The VD divides the whole space into evenly dislodged subspaces, based on the nearest neighbour rule. For the past few decades, the implementation of VD in a variety of applications is drawing huge attention (Yue Lu et al., 2005). The line segments that comprise, half lines or infinite lines are called as Voronoi edges and they, constitute the limits of Voronoi regions. These edges are gotten obtained by drawing bisectors at a 90 degree angle to the line joining the two points in the plane. The points that are used in producing Voronoi edge are termed as Voronoi neighbours. The midpoint of ana vacant circle that touching touches three or more sites areis called as Voronoi vertex. Shatnawi and Omar ( 2009) state that, the convex polygon shaped Voronoi regions are limited or unlimited, Drysdale (1993).