Ө (1) time Parallel Agorithm for Finding 2D Convex Hull on a Reconfigurable Mesh Computer Architecture

Abstract

In this paper we propose a parallel algorithm in image processing in 1 time intended for a parallel machine Reconfigurable Mesh Computer RMC of size n x n Elementary Processors PE The algorithm consists in determining the convex envelope of a two-level 2D image with a complexity in 1 time The approach used is purely geometric It is based solely on the projection of the coordinates of PEs retained in specific quadrants and on the application of the algorithm that determines the Min Max in 1 time This has reduced the complexity of the algorithm for determining the convex hull at 1 time