✦ LIBER ✦

Diagonal flips in triangulations of surfaces

✍ Scribed by Seiya Negami

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 518 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0101-9

No coin nor oath required. For personal study only.

✦ Synopsis

It will be shown that any two triangulations of a closed surface can be transformed into each other by flipping diagonals in quadrilaterals if they have a sufficiently large and equal number of vertices.

📜 SIMILAR VOLUMES

Simultaneous diagonal flips in plane tri

Simultaneous diagonal flips in plane triangulations

✍ Prosenjit Bose; Jurek Czyzowicz; Zhicheng Gao; Pat Morin; David R. Wood 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

## Abstract Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every triangulation with __n__ ≥ 6 vertices has a simultaneous flip into a 4‐connected triangulation, and that the set of edges to be flipped can be computed in $\cal O$(__n__) time. It follows that

Diagonal Flips of Triangulations on Clos

Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties

✍ Richard Brunet; Atsuhiro Nakamoto; Seiya Negami 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Consider a class P of triangulations on a closed surface F 2 , closed under vertex splitting. We shall show that any two triangulations with the same and sufficiently large number of vertices which belong to P can be transformed into each other, up to homeomorphism, by a finite sequence of diagonal

Diagonal Flips in Triangulations on Clos

Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4

✍ Hideo Komuro; Atsuhiro Nakamoto; Seiya Negami 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 365 KB

It will be shown that any two triangulations on a closed surface, except the sphere, with minimum degree at least 4 can be transformed into each other by a finite sequence of diagonal flips through those triangulations if they have a sufficiently large and same number of vertices. The same fact hold

Enumeration of Rooted Planar Triangulati

Enumeration of Rooted Planar Triangulations with Respect to Diagonal Flips

✍ Zhicheng Gao; Jianyu Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

We use the generating function approach to enumerate two families of rooted planar near-triangulations (2-connected, and 2-connected with no multiple edges) with respect to the number of flippable edges. It is shown that their generating functions are algebraic. Simple explicit expressions are obtai

N-flips in even triangulations on the sp

N-flips in even triangulations on the sphere

✍ Atsuhiro Nakamoto; Tadashi Sakuma; Yusuke Suzuki 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N-flip and the P 2 -flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed int

Diagonal 11-coloring of plane triangulat

Diagonal 11-coloring of plane triangulations

✍ Oleg V. Borodin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract The vertices of each plane triangulation without loops and multiple edges may be colored with 11 colors so that for every two adjacent triangles [__xyz__] and [__wxy__], the vertices __x__,__y__,__w__,__z__ are colored pairwise differently.