Diagonal-Flip Distance Algorithms of Three Type Triangulations

In this paper we study the diagonal flipping problem in three special type triangulations of n (n > 7) vertex convex polygons (and rotations in three type binary trees). By labelling vertices of the triangulations, we propose six linear time algorithms for computing diagonal-flip distances in these three type triangulations (and rotation distance in these three type binary trees).