T' = bistellarFlip(T, c)tri' = bistellarFlip(tri, c)A circuit on $d{+}1$ points admits two triangulations of its convex hull: $T_-$, omitting each vertex listed in neg, and $T_+$, omitting each vertex listed in pos. Exactly one of these (say $T_-$) sits inside $T$, supported on a common link $L$; the bistellar flip replaces $L \star T_-$ with $L \star T_+$.
If neither side has a common link in $T$ -- for example, the simplices of one side appear with mismatched links, or one side is only partially present -- the flip is undefined and this returns null.
|
|
|
|
|
|
Many candidate circuits returned by flipCandidates are not flippable in any given $T$; those return null.
|
The object bistellarFlip is a method function.
The source of this document is in Triangulations.m2:2103:0.