Construction of Three-Dimensional Constrained Triangulations
Barry Joe · 2008
A heuristic algorithm for constructing 3-D constrained triangulations is presented. The algorithm consists of flips with the goal of attaining constrained edges and constrained faces missing from a given triangulation, schemes for attaining constrained edges that are missing from the triangulation, and approaches for attaining constrained faces that are missing from the triangulation. The algorithm is not guaranteed to succeed for all problem instances, although the heuristics are successful in most practical instances. The most difficult cases are when there are non-adjacent constrained faces that are much closer to each other than the length of the edges involved. 1