Constant time algorithms for computing the contour of maximal elements on the reconfigurable mesh

There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents two O(1) time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N×N while the second one uses a 3-D RM of size √N×√N×√N