An implicitization algorithm with fewer variables

In this paper we present a general implicitization algorithm for rational parameterizations, using Gröbner Bases, which: (i) is valid for general parametric varieties (i.e. allowing both rational or polynomial parameterizations), (ii) computes the greatest ideal of polynomials vanishing over the var...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer aided geometric design Ročník 12; číslo 3; s. 251 - 258
Hlavní autoři: Alonso, Cesar, Gutierrez, Jaime, Recio, Tomas
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.05.1995
Elsevier
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Gröbner bases
Implicitization
Parametric varieties
Pattern recognition. Digital image processing. Computational geometry
Theoretical computing
Gröbner bases
Implicitization
Parametric varieties
Computational geometry
Parametrization
Gröbner basis
Algorithm performance
ISSN:0167-8396, 1879-2332
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper we present a general implicitization algorithm for rational parameterizations, using Gröbner Bases, which: (i) is valid for general parametric varieties (i.e. allowing both rational or polynomial parameterizations), (ii) computes the greatest ideal of polynomials vanishing over the variety and (iii) uses only as many variables as the number of parameters plus coordinates. We give examples of the performance of our algorithm in the CoCoa system, comparing the obtained results with other algorithms.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8396
1879-2332
DOI:10.1016/0167-8396(95)91147-R