Name
Abstract | ||
|---|---|---|
Motivated by the computation of intersection loci in Computer Aided Geometric Design (CAGD), we introduce and study the elimination problem for systems of three bivariate polynomial equations with separated variables. Such systems are simple sparse bivariate ones but resemble to univariate systems of two equations both geometrically and algebraically. Interesting structures for generalized Sylvester and bezoutian matrices can be explicited. Then one can take advantage of these structures to represent the objects and speed up the computations. A corresponding notion of subresultant is presented and related to a Gröbner basis of the polynomial system. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1277548.1277571 | ISSAC |
Keywords | Field | DocType |
geometric design,generalized sylvester,bivariate polynomial equation,separated variable,corresponding notion,bezoutian matrix,elimination problem,bner basis,simple sparse bivariate,polynomial system,interesting structure,algorithms,sylvester matrix | Discrete mathematics,Combinatorics,Algebra,Polynomial,Matrix (mathematics),Gröbner basis,Bivariate analysis,Sylvester matrix,Univariate,Mathematics,Speedup,Computation | Conference |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Elkadi | 1 | 51 | 5.76 |
| A. Galligo | 2 | 76 | 11.72 |