Macaulay2 » Documentation
Packages » Triangulations :: isFine
next | previous | forward | backward | up | index | toc

isFine -- test whether a triangulation uses every point in the configuration

Description

A triangulation is fine if every point of the configuration is a vertex of some simplex. Non-fine triangulations triangulate the convex hull but leave one or more points (typically interior or on the relative boundary) unused.

i1 : A = transpose matrix {{0,3},{0,1},{-1,-1},{1,-1},{-4,-2},{4,-2}}

o1 = | 0 0 -1 1  -4 4  |
     | 3 1 -1 -1 -2 -2 |

              2       6
o1 : Matrix ZZ  <-- ZZ
i2 : Ts = allTriangulations A;
i3 : tally apply(Ts, isFine)

o3 = Tally{false => 10}
           true => 6

o3 : Tally

Caveat

This function does not check that tri is a valid triangulation; it only inspects the support. See isWellDefined(Triangulation) for that.

See also

Ways to use isFine:

  • isFine(Matrix,List)
  • isFine(Triangulation)

For the programmer

The object isFine is a method function.


The source of this document is in Triangulations.m2:1730:0.