Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

The paper presents a parallel algorithm for polygon approximation targeted at reconfigurable multi-ring hardware. The proposed algorithm grows the edges of polygon approximation that is based on principle of merging. The edge/s are grown simultaneously at point/s where the minimum merging error is produced. The merging process is made faster by carrying it out in two stages: i) During first stage it uses templates, generated during an off line process, to carry out fast initial polygon approximation, ii) The segments of the initial polygon approximation are further merged during the second stage. The simultaneous growing of edges makes the algorithm suitable for a parallel processing hardware. The paper outlines a parallel algorithm for polygon approximation. It discusses three broadcasting mechanisms for utilizing the multi-ring hardware. The mapping of the polygon approximation algorithm on the multi-ring topology using various broadcasting mechanisms is discussed. Index Terms Parallel algorithm for polygon approximation, Local and global error for polygon approximation, Reconfigurable multi-ring network, broadcasting mechanisms for multi-ring network.