International Journal of Computer Science Issues

More than a traditional journal...

In this article an efficient technique has been presented to digitize polygon objects of a black and white raster map/image. Any polygon segment may be represented by a closed sequence of line segments. Every line segment of a polygon constitutes of black points with RGB value. In this proposed method, initially mouse click operation has to perform on or closer to each of the line segments. If the clicked point is not on the line then eight connected points of each of the click point is calculated and this process may be repeated to obtain the black point. After obtaining the black points for every line segments, each black point are considered as selected points for each of the line segments. Next calculation of successive black points on both sides of the selected point of each of the line segments are performs until it reached to the junction point (i.e. black point has more than three four-connected pixels). Black points on both side of the selected point for a line are merged to obtain the line segment. Finally each of the line segments are merged to obtained the closed polygon. The points of closed segment are minimized using the computation of minimal set of boundary points of segments. Currently many of the existing methods required lot of memory space for the processing to producing the boundary points. This proposed technique efficiently minimizes the complexity to construct the polygon objects.