A Triangulation packages a point (or vector) configuration $A$ together with a triangulation of the columns of $A$, given as a list of maximal simplices. Each simplex is a sorted list of column indices into $A$, and the outer list is sorted as well.
Construct a Triangulation with triangulation from an explicit matrix and list, or with regularFineTriangulation from just a matrix. Inspect one with the accessors max(Triangulation), vectors(Triangulation), and matrix(Triangulation).
|
|
|
|
|
By default, the matrix stored in T is the homogenized configuration, with a final row of $1$'s appended; most algorithms in this package operate on homogenized vectors. Pass Homogenize => false to triangulation if the input is already a vector configuration.
The object Triangulation is a type, with ancestor classes HashTable < Thing.
The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/Triangulations.m2:1187:0.