An efficient upper bound of the rotation distance of binary trees

A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.

• Type: Journal
• Year: 2000
• Where: IPL
• Authors: Jean Marcel Pallo
• Keywords: Convex Polygons Triangulations, IPL 2000, Polynomial Time Algorithm, Rotation Distance