相关论文: A Bound on the Edge-Flipping Distance between Tria…

Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…

We investigate a type of distance between triangulations on finite type surfaces where one moves between triangulations by performing simultaneous flips. We consider triangulations up to homeomorphism and our main results are upper bounds…

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…

For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…

Let ${\cal T}$ be a triangulation of a set ${\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\em flip} of $e$ is…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…

Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…

Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

Given a surface $\Sigma$ equipped with a set $P$ of marked points, we consider the triangulations of $\Sigma$ with vertex set $P$. The flip-graph of $\Sigma$ whose vertices are these triangulations, and whose edges correspond to flipping…

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if…

The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…

Given two pants decompositions of a compact orientable surface $S$, we give an upper bound for their distance in the pants graph that depends logarithmically on their intersection number and polynomially on the Euler characteristic of $S$.…

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…

Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…

Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…