Flipping in spirals

Computational Geometry(2021)

引用 0|浏览3
暂无评分
摘要
We study the number of edge flips required to transform any triangulation of an n-vertex spiral polygon into any other. We improve the upper bound from 4n−6 to 3n−9 flips and show a lower bound of 2n−8 flips. Instead of using a single canonical triangulation as the intermediate point in the transformation between two triangulations, we use a family of closely-connected triangulations.
更多
查看译文
关键词
Edge flip,Diagonal flip,Spiral polygon
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要