We present efficient and robust algorithms for intersecting a rational parametric freeform surface with a general swept surface. A swept surface is given as a one-parameter family of cross-sectional curves. By computing the intersection between a freeform surface and each cross-sectional curve in the family, we can solve the intersection problem. We propose two approaches, which are closely related to each other. The first approach detects certain critical points on the intersection curve, and then connects them in a correct topology. The second approach converts the intersection problem to that of finding the zero-set of polynomial equations in the parameter space. We first present these algorithms for the special case of intersecting a fr...
Solid objects shape modelling is a basic sight of CAD. The shape of a solid is usually defined by as...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
A user-friendly 'divide-and-conquer' algorithm, which finishes quickly, is presented for finding all...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
AbstractIn this paper a new algorithm for computing the intersection of two rational ruled surfaces,...
The intersection curve between parametric surfaces is important in such computer-aided design and ma...
Computing the intersection curve of two surfaces is a fundamental problem in many areas, such as the...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
An improved algorithm for the computation of the intersection curve of two general parametric surfac...
This paper presents the mathematical framework, and develops algorithms accordingly, to continuously...
Abstract. This paper presents the mathematical framework, and de-velops algorithms accordingly, to c...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
A swept surface is generated from a profile curve and a sweep curve by employing the latter to defin...
Solid objects shape modelling is a basic sight of CAD. The shape of a solid is usually defined by as...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
A user-friendly 'divide-and-conquer' algorithm, which finishes quickly, is presented for finding all...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
We present efficient and robust algorithms for intersecting a rational parametric freeform surface w...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
AbstractIn this paper a new algorithm for computing the intersection of two rational ruled surfaces,...
The intersection curve between parametric surfaces is important in such computer-aided design and ma...
Computing the intersection curve of two surfaces is a fundamental problem in many areas, such as the...
Surfaces of revolution belong to an important class of geometric models with simpler shape character...
An improved algorithm for the computation of the intersection curve of two general parametric surfac...
This paper presents the mathematical framework, and develops algorithms accordingly, to continuously...
Abstract. This paper presents the mathematical framework, and de-velops algorithms accordingly, to c...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
A swept surface is generated from a profile curve and a sweep curve by employing the latter to defin...
Solid objects shape modelling is a basic sight of CAD. The shape of a solid is usually defined by as...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
A user-friendly 'divide-and-conquer' algorithm, which finishes quickly, is presented for finding all...