Given two curves in the projective space, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the inputs which vanishes if and only if the two curves intersect. This could be useful in Computer Aided Design, for computing the intersection of algebraic surfaces
Please, see the errata.pdf attached file.International audienceIn this article, we first generalize ...
Abstract. This paper presents the mathematical framework, and de-velops algorithms accordingly, to c...
International audienceThe computation of intersection and self-intersection loci of parameterized su...
Given two curves in the projective space, either implicitly or by a parameterization, we want to che...
In this paper we introduce an intermediate representation of surfaces that we call semi-implicit. We...
AbstractIn this paper a new algorithm for computing the intersection of two rational ruled surfaces,...
Computing the intersection curve of two surfaces is a fundamental problem in many areas, such as the...
AbstractIn this paper we introduce an intermediate representation of surfaces that we call semi-impl...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
In this paper, we introduce and study a new implicit representation of parametric curves and paramet...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
One area of interest in studying plane curves is intersection. Namely, given two plane curves, we ar...
This thesis presents a robust and efficient algorithm for the computation of an exact parameterized ...
International audienceEvaluating the intersection of two rational parameterized algebraic surfaces i...
International audienceThe intersection curve of two parameterized surfaces is characterized by 3 eq...
Please, see the errata.pdf attached file.International audienceIn this article, we first generalize ...
Abstract. This paper presents the mathematical framework, and de-velops algorithms accordingly, to c...
International audienceThe computation of intersection and self-intersection loci of parameterized su...
Given two curves in the projective space, either implicitly or by a parameterization, we want to che...
In this paper we introduce an intermediate representation of surfaces that we call semi-implicit. We...
AbstractIn this paper a new algorithm for computing the intersection of two rational ruled surfaces,...
Computing the intersection curve of two surfaces is a fundamental problem in many areas, such as the...
AbstractIn this paper we introduce an intermediate representation of surfaces that we call semi-impl...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
In this paper, we introduce and study a new implicit representation of parametric curves and paramet...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
One area of interest in studying plane curves is intersection. Namely, given two plane curves, we ar...
This thesis presents a robust and efficient algorithm for the computation of an exact parameterized ...
International audienceEvaluating the intersection of two rational parameterized algebraic surfaces i...
International audienceThe intersection curve of two parameterized surfaces is characterized by 3 eq...
Please, see the errata.pdf attached file.International audienceIn this article, we first generalize ...
Abstract. This paper presents the mathematical framework, and de-velops algorithms accordingly, to c...
International audienceThe computation of intersection and self-intersection loci of parameterized su...