The Reconfigurable Mesh (RM) attracted criticism for its key assumption that a message can be broadcast in constant time independent of bus length To account for this limit Beresford-Smith et al. have recently proposed k-constrained RM where buses of length at most k, a constant, are allowed to b formed. Straightforward simulations of optimal RM algorithms on this constrained RM model are found to be non-optimal. This paper presents two optimal algorithms to compute the contour of maximal elements of a set of planar points
