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).

DOI: 10.1109/CSSE.2008.337

Extracted Key Phrases

1 Figure or Table

Cite this paper

@article{Wang2008DiagonalFlipDA, title={Diagonal-Flip Distance Algorithms of Three Type Triangulations}, author={Deqiang Wang and Xian Wang and Shaoxi Li and Shaofang Zhang}, journal={2008 International Conference on Computer Science and Software Engineering}, year={2008}, volume={2}, pages={980-983} }