(inG,G) = projectivePoints(M,R)
This function uses a modified Buchberger-Moeller algorithm to compute a grobner basis for the ideal of a finite number of points in projective space.
|
|
|
|
This algorithm may be faster than computing the intersection of the ideals of each projective point.
This function removes zero columns of M and duplicate columns giving rise to the same projective point (which prevent the algorithm from terminating). The user can bypass this step with the option VerifyPoints.
The object projectivePoints is a method function with options.