Flipping Cubical Meshes

We define and examine flip operations for quadrilateral and hexahedral meshes, similar to the flipping transformations previously used in triangular and tetrahedral mesh generation.Comment: 20 pages, 24 figures. Expanded journal version of paper from 10th International Meshing Roundtable. This version removes some unwanted paragraph breaks from the previous version; the text is unchange

Flip Graphs of Degree-Bounded (Pseudo-)Triangulations

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 and only if $k > 6$; the diameter of the flip graph is $O(n^2)$. We also show that, for general point sets, flip graphs of pointed pseudo-triangulations can be disconnected for $k \leq 9$, and flip graphs of triangulations can be disconnected for any $k$. Additionally, we consider a relaxed version of the original problem. We allow the violation of the degree bound $k$ by a small constant. Any two triangulations with maximum degree at most $k$ of a convex point set are connected in the flip graph by a path of length $O(n \log n)$, where every intermediate triangulation has maximum degree at most $k+4$.Comment: 13 pages, 12 figures, acknowledgments update

Transforming triangulations on non planar-surfaces

We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable exceptions, such as polygons on the cylinder, and on the flat torus, and certain configurations of points on the cylinder.Comment: 19 pages, 17 figures. This version has been accepted in the SIAM Journal on Discrete Mathematics. Keywords: Graph of triangulations, triangulations on surfaces, triangulations of polygons, edge fli

The Discrete Fundamental Group of the Associahedron, and the Exchange Module

The associahedron is an object that has been well studied and has numerous applications, particularly in the theory of operads, the study of non-crossing partitions, lattice theory and more recently in the study of cluster algebras. We approach the associahedron from the point of view of discrete homotopy theory. We study the abelianization of the discrete fundamental group, and show that it is free abelian of rank $\binom{n+2}{4}$. We also find a combinatorial description for a basis of this rank. We also introduce the exchange module of the type $A_n$ cluster algebra, used to model the relations in the cluster algebra. We use the discrete fundamental group to the study of exchange module, and show that it is also free abelian of rank $\binom{n+2}{3}$.Comment: 16 pages, 4 figure