(inG,G) = projectiveFatPoints(M,mults,R)
This function uses a modified Buchberger-Moeller algorithm to compute a grobner basis for the ideal of a finite number of fat points in projective space.
|
|
|
|
|
For small sets of points and/or multiplicities, this method might be slower than projectiveFatPointsByIntersection.
The object projectiveFatPoints is a method function with options.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/Points.m2:1290:0.