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.

How to Cite
ELMESBAHI, MOHAMMED KHALDOUN, AHMED ERRAMI, OMAR BOUATTANE, Jelloul. Ө (1) time Parallel Agorithm for Finding 2D Convex Hull on a Reconfigurable Mesh Computer Architecture. Global Journal of Computer Science and Technology, [S.l.], mar. 2021. ISSN 0975-4172. Available at: <https://computerresearch.org/index.php/computer/article/view/2017>. Date accessed: 23 jan. 2022.