Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
Rotation distance, triangulations, and hyperbolic geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the rotation distance in the lattice of binary trees
Information Processing Letters
Short encodings of evolving structures
SIAM Journal on Discrete Mathematics
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computer musings (videotape): the associative law, or the anatomy of rotations in binary trees
Computer musings (videotape): the associative law, or the anatomy of rotations in binary trees
Flipping edges in triangulations
Proceedings of the twelfth annual symposium on Computational geometry
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On distances between phylogenetic trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Approximation algorithms are developed for the diagonal-flip transformation of convex polygon triangulations and equivalently rotation transformation of binary trees. For two arbitrary triangulations in which each vertex is an end of at most d diagonals, Algorithm A has the approximation ratio 2- 2/4(d-1)(d+6)+1. For triangulations containing no internal triangles, Algorithm B has the approximation ratio 1.97. Two self-interesting lower bounds on the diagonal-flip distance are also established in the analyses of these two algorithms.