Add to ORKGThe problem of numerically computing an approximate parameterization of the curve of intersection of (n-1) surfaces in $R^n$ is considered. A precise definition of an ϵ-approximate parameterization is given. It is shown that, under reasonable conditions, the parameterization computed by marching methods using local error control is ϵ-approximate. Various integration methods are compared. A particular Runge-Kutta method shows up as the strong favourite for use in geometric modelling
The determination of the intersection curve between two surfaces may be seen as two different and se...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
In recent years a number of techniques based on the subdivision principle have been suggested for de...
The problem of numerically computing an approximate parameterization of the curve of intersection of...
A clear definition of an approximate parametrization of the curve of intersection of (n-1) implicit ...
This paper presents a marching method for computing intersection curves between two solids represent...
An efficient way of drawing parametric curves and surfaces is to approximate the curve or surface by...
An efficient way of drawing parametric curves and surfaces is to approximate the curve or surface by...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
This thesis presents a robust method for tracing intersection curve segments between continuous rati...
The intersection problem is one of the major task in Computer Aided Geometric Design (CAGD). In orde...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
This paper presents a simple and elegant algorithm to estimate adaptively the stepping direction and...
This paper presents the mathematical framework, and develops algorithms accordingly, to continuously...
The research of intersection curves of two parametric surfaces is one of the most delicat and indisp...
The determination of the intersection curve between two surfaces may be seen as two different and se...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
In recent years a number of techniques based on the subdivision principle have been suggested for de...
The problem of numerically computing an approximate parameterization of the curve of intersection of...
A clear definition of an approximate parametrization of the curve of intersection of (n-1) implicit ...
This paper presents a marching method for computing intersection curves between two solids represent...
An efficient way of drawing parametric curves and surfaces is to approximate the curve or surface by...
An efficient way of drawing parametric curves and surfaces is to approximate the curve or surface by...
We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our a...
This thesis presents a robust method for tracing intersection curve segments between continuous rati...
The intersection problem is one of the major task in Computer Aided Geometric Design (CAGD). In orde...
This paper presents an overview of surface intersection problems and focuses on the rational polynom...
This paper presents a simple and elegant algorithm to estimate adaptively the stepping direction and...
This paper presents the mathematical framework, and develops algorithms accordingly, to continuously...
The research of intersection curves of two parametric surfaces is one of the most delicat and indisp...
The determination of the intersection curve between two surfaces may be seen as two different and se...
The use of discrete data to represent engineering structures as derivatives from intersecting compon...
In recent years a number of techniques based on the subdivision principle have been suggested for de...