Efficient lower and upper bounds of the diagonal-flip distance between triangulations

Jean-Luc Baril, Jean-Marcel Pallo
2006 Information Processing Letters  
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
doi:10.1016/j.ipl.2006.07.001 fatcat:qfvdl4lglvfrfo2iiavvf6busi