Diagonal-Flip Distance Algorithms of Three Type Triangulations

2008 ◽  
Author(s):  
Deqiang Wang ◽  
Xian Wang ◽  
Shaoxi Li ◽  
Shaofang Zhang
Keyword(s):  
Flip Distance

scholarly journals An improved FPT algorithm for the flip distance problem

2021 ◽  
pp. 104708
Author(s):  
Qilong Feng ◽  
Shaohua Li ◽  
Xiangzhong Meng ◽  
Jianxin Wang
Keyword(s):  
Fpt Algorithm ◽  
Distance Problem ◽  
Flip Distance

scholarly journals Computing the Flip Distance Between Triangulations

2017 ◽  
Vol 58 (2) ◽  
pp. 313-344 ◽  
Author(s):  
Iyad Kanj ◽  
Eric Sedgwick ◽  
Ge Xia
Keyword(s):  
Flip Distance

scholarly journals Flip Distance Between Triangulations of a Simple Polygon is NP-Complete

2015 ◽  
Vol 54 (2) ◽  
pp. 368-389 ◽  
Author(s):  
Oswin Aichholzer ◽  
Wolfgang Mulzer ◽  
Alexander Pilz
Keyword(s):  
Simple Polygon ◽  
Np Complete ◽  
Flip Distance

scholarly journals Flip distance to some plane configurations

2019 ◽  
Vol 81 ◽  
pp. 12-21
Author(s):  
Ahmad Biniaz ◽  
Anil Maheshwari ◽  
Michiel Smid
Keyword(s):  
Flip Distance

scholarly journals Common Edges in Rooted Trees and Polygonal Triangulations

10.37236/2541 ◽  
2013 ◽  
Vol 20 (1) ◽  
Author(s):  
Sean Cleary ◽  
Andrew Rechnitzer ◽  
Thomas Wong
Keyword(s):  
Polynomial Time ◽  
Rooted Trees ◽  
Binary Trees ◽  
Regular Polygons ◽  
Large Component ◽  
Polynomial Time Algorithms ◽  
The Common ◽  
Flip Distance ◽  
Degree Of Similarity ◽  
Insight Into

Rotation distance between rooted binary trees measures the degree of similarity of two trees with ordered leaves and is equivalent to edge-flip distance between triangular subdivisions of regular polygons. There are no known polynomial-time algorithms for computing rotation distance. Existence of common edges makes computing rotation distance more manageable by breaking the problem into smaller subproblems. Here we describe the distribution of common edges between randomly-selected triangulations and measure the sizes of the remaining pieces into which the common edges separate the polygons. We find that asymptotically there is a large component remaining after sectioning off numerous small polygons which gives some insight into the distribution of such distances and the difficulty of such distance computations, and we analyze the distributions of the sizes of the largest and smaller resulting polygons.

Sign in / Sign up

Export Citation Format

Share Document