Local combinatorial move on a triangulation that replaces the common diagonal of a convex quadrilateral formed by two adjacent triangles with the other diagonal, producing a new triangulation of the same vertex set and connectivity type.

Principle

Edge flip is a bistellar, topology-preserving local transformation: it alters adjacency and triangle incidence by toggling which pair of vertices is connected inside a convex four-vertex cell, used to explore triangulation space or enforce local criteria (e.g. Delaunay).

Demonstration

Given two adjacent triangles sharing diagonal AB in a planar triangulation whose union is a convex quadrilateral ABCD, performing an edge flip replaces AB by CD; repeated flips can convert an arbitrary triangulation into the Delaunay triangulation by resolving non-Delaunay edges.

Misapplication

Attempting to flip an edge when the union of the two incident triangles is non-convex or when flipping would violate manifold or boundary constraints (creating inverted elements on surfaces), or assuming flips preserve metric quality without checking element shapes.

Consequence

Edge flips connect triangulations via the flip graph, provide a local tool to optimize angle or circumcircle conditions, and enable algorithms for incremental Delaunay construction, mesh improvement and topological reconfiguration while preserving vertex set.

Reversal

The inverse of a flip is another flip on the new diagonal, so sequences of flips are reversible; however, reversing a path of flips may not restore intermediate geometric qualities if vertex positions changed meanwhile.

Boundary

Applies to triangulations where two triangles share a diagonal and their union is convex in the embedding; excluded are flips across non-convex quadrilaterals, across constrained boundary edges, or in meshes where topology (valence-preserving constraints) forbids local diagonal replacement.

Semantic Tension

Distinguish an edge flip (local combinatorial diagonal swap) from global re-triangulation or topological operations like edge collapse/split: flips keep vertex set fixed and preserve topology, while collapse/split change vertex count or connectivity more drastically.

Synthesis

The edge flip operation is the minimal, reversible local move on triangulations: when two adjacent triangles form a convex quadrilateral, toggle the diagonal to alter adjacency and local quality, enabling traversal of triangulation space and enforcement of local optimality conditions such as Delaunayhood.