S = splineMatrix(V,F,E,r)
S = splineMatrix(V,F,r)
S = splineMatrix(L,r)
S = splineMatrix(B,H,r)
This creates the basic spline matrix that has splines as its kernel.
|
|
|
|
If each codimension one face of $\Delta$ is the intersection of exactly two facets, then the list of edges is unnecessary.
|
|
|
Splines are automatically computed on the cone over the given complex $\Delta$, and the last variable of the polynomial ring is always the variable used to homogenize. If the user desires splines over $\Delta$, use the option Homogenize=>false.
|
|
|
If the user would like to define the underlying ring (e.g. for later reference), this may be done using the option BaseRing=>R, where R is a polynomial ring defined by the user.
|
|
|
|
Here is an example where the output is homogenized. Notice that homogenization occurs with respect to the last variable of the polynomial ring.
|
|
|
|
Alternately, the spline matrix can be created directly from the dual graph (with edges labeled by linear forms). Note: This way of entering data requires the ambient polynomial ring to be defined. See also the generalizedSplines method.
|
|
|
|
The object splineMatrix is a method function with options.