A complete and non-overlapping tracing algorithm for closed loops
A procedure for tracing completely closed loops given implicitly by the intersection of two regular surfaces, without resorting to the parametric domain subdivisions or resulting in arc overlapping, is presented. Our primary hypothesis is that the ...
A robust algorithm for finding the real intersections of three quadric surfaces
By Bezout's theorem, three quadric surfaces have at most eight isolated intersections although they may have infinitely many intersections. In this paper, we present an efficient and robust algorithm, to obtain the isolated and the connected components ...
Constrained space curve interpolation with constraint planes
We consider the interpolation of a given set of ordered data points in R^3 by a smooth curve in the presence of a set of finite or infinite constraint planes, where the polyline joining consecutive data points does not intersect the constraint planes. A ...
Helix approximations with conic and quadratic Bézier curves
In this paper we present the error analysis for the approximation of a cylindrical helix by conic and quadratic Bezier curves. The approximation method yields G^1 conic spline and G^1 quadratic spline, respectively. We give a sharp upper bound of the ...
