On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph
share
In this paper, we present some rather basic and fundamental results on sequence of flips and triangulations of polyhedra. We studied the stricture properties of a directed flip graph. The result explains clearly the behaviour of classical Lawson's flip algorithm. As an application, we describe a simple algorithm to triangulate a special class of 3d non-convex polyhedra.
READ FULL TEXT