Implicitization of rational parametric surfaces (Q2563695): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: George J. Fix / rank | |||
Property / author | |||
Property / author: George J. Fix / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997616667 / rank | |||
Normal rank |
Latest revision as of 22:52, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Implicitization of rational parametric surfaces |
scientific article |
Statements
Implicitization of rational parametric surfaces (English)
0 references
7 September 1998
0 references
Let \(S\subset \mathbb{C}^3\) be a surface parametrized by a map \(F_a(s,t)= (f_1(s,t),\;f_2(s,t),\;f_3(s,t))\), where \(f_i\) are polynomials in \(s\) and \(t\). The implicitization process would find an equation \(f(x,y,z)=0\) such that the zero locus of the equation, \(W=\{(x,y, z)\mid f(x,y,z) =0\}\), is the smallest subset \(W\subset \mathbb{C}^3\) that contains the image \(S\) of the parametrization. A generalized projective implicitization theorem is presented that can be used to solve the implicitization of rational parametric curves and surfaces in an affine space. The Gröbner bases technique is used to implement the algorithm. The algorithm has the advantages that it can handle base points in a parametrization, and no extra factors will be introduced into an implicit equation. The complexity of the algorithm in terms of the degrees of the polynomials in the Gröbner basis is better than the existing method.
0 references
implicitization of rational parametric surfaces
0 references
implicitization of rational parametric curves
0 references
complexity
0 references
Gröbner basis
0 references