After understanding the logic of creating mr-convex hull of a set of points, I tried making a sketch that explains the idea clearly (hopefully) for a point set of 3 non-collinear points. You can access the sketch here. I have used the definition of mr-convex hull shown here taken from this paper.

Also, I think the two important papers in this field, paper-1 and paper-2 are confusing on one aspect. Both papers read that the algo they present are for obtaining the r-convex hull and then cr-convex hull (from the obtained r-convex hull) of a set of points. Whereas, I think both the papers' algo compute the mr-convex hull first and then the cr-convex hull (from the mr-convex hull).

After understanding the logic of creating mr-convex hull of a set of points, I tried making a sketch that explains the idea clearly (hopefully) for a point set of 3 non-collinear points. You can access the sketch here. I have used the definition of mr-convex hull shown here taken from this paper.

Also, I think the two important papers in this field, paper-1 and paper-2 are confusing on one aspect. Both papers read that the algo they present are for obtaining the r-convex hull and then cr-convex hull (from the obtained r-convex hull) of a set of points. Whereas, I think both the papers' algo compute the mr-convex hull first and then the cr-convex hull (from the mr-convex hull).