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 $...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Carleton University
2025-07-01
|
| coleção: | Journal of Computational Geometry |
| Acesso em linha: | https://jocg.org/index.php/jocg/article/view/3328 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|