An interlaced algorithm for transforming plane triangulations using simultaneous flips
Any two $n$-vertex combinatorial triangulations are transformable to on another using a finite sequence of diagonal flips. It has been established that $\mathcal{O}(n)$ individual flips suffice to complete this transformation. It is known that the transformation can also be done with no more than $...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Carleton University
2025-07-01
|
| سلاسل: | Journal of Computational Geometry |
| الوصول للمادة أونلاين: | https://jocg.org/index.php/jocg/article/view/3328 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|