#### Filter Results:

- Full text PDF available (32)

#### Publication Year

1991

2017

- This year (4)
- Last 5 years (10)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Laurent Busé, Marc Chardin
- J. Symb. Comput.
- 2005

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in Busé and Jouanolou… (More)

- Laurent Busé, Mohamed Elkadi, Bernard Mourrain
- J. Symb. Comput.
- 2000

In this paper, we propose a new method, based on Bezoutian matrices, for computing a nontrivial multiple of the resultant over a projective variety X, which is described on an open subset by a… (More)

- Laurent Busé, Houssam Khalil, Bernard Mourrain
- CASC
- 2005

We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials… (More)

- Laurent Busé, Ron Goldman
- Computer Aided Geometric Design
- 2008

Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD… (More)

We show that the method of moving quadrics for implicitizing surfaces in P applies in certain cases where base points are present. However, if the ideal defined by the parametrization is saturated,… (More)

- Laurent Busé, M. Elkadi
- 2003

In this article, we study the residual resultant which is the necessary and sufficient condition for a polynomial system F to have a solution in the residual of a variety, defined here by a complete… (More)

- Laurent Busé
- 2003

In this paper, we investigate some topics around the closed image S of a rational map λ given by some homogeneous elements f1, . . . , fn of the same degree in a graded algebra A. We first compute… (More)

- Laurent Busé, Carlos D'Andrea
- ISSAC
- 2004

We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in the case where it… (More)

- Laurent Busé, Bernard Mourrain
- Math. Comput.
- 2009

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree… (More)

- Laurent Busé
- ISSAC
- 2001

In this article, we first generalize the recent notion of residual resultant of a complete intersection [4] to the case of a local complete intersection of codimension 2 in the projective plane,… (More)