Triangular Berstein-Be´zier patches
Computer Aided Geometric Design
Computer Aided Geometric Design - Special issue: Topics in CAGD
Loop detection in surface patch intersections
Computer Aided Geometric Design
Computer Aided Geometric Design
Improved test for closed loops in surface intersections
Computer-Aided Design
Convergence of a surface/surface intersection algorithm
Computer Aided Geometric Design
A marching method for parametric surface/surface intersection
Computer Aided Geometric Design
Recursive subdivision and iteration in intersections and related problems
Mathematical methods in computer aided geometric design
Using plane vector fields to obtain all the intersection curves of two general surfaces
Theory and practice of geometric modeling
On determining start points for a surface/surface intersection algorithm
Computer Aided Geometric Design
Procedural method for evaluating the intersection curves of two parametric surfaces
Computer-Aided Design
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curves and surfaces for computer aided geometric design (3rd ed.): a practical guide
Curvature computations for degenerate surface patches
Computer Aided Geometric Design
An introduction to computational geometry for curves and surfaces
An introduction to computational geometry for curves and surfaces
A new approach to the surface intersection problem
Computer Aided Geometric Design
Exploiting topological and geometric properties for selective subdivision
SCG '85 Proceedings of the first annual symposium on Computational geometry
Computational Geometry for Design and Manufacture
Computational Geometry for Design and Manufacture
Ray-Tracing Triangular Trimmed Free-Form Surfaces
IEEE Transactions on Visualization and Computer Graphics
Methods for computing NASCAR tire/track intersections
Proceedings of the 49th Annual Southeast Regional Conference
| Hi-index | 0.00 |
This paper presents, in the general setting of derivational continuities, a surface/plane intersection algorithm based on a tracing method in which the intersection curves are traced out in the direction of tangent vectors at intersection points for parametric Bezier triangular surface over triangular domain. The intersection curves are given by ordered pairs of surface domain points, and are represented by their piece-wise polynomial approximations. The aim is to obtain the smallest number of structured and ordered points that correctly represent the topology of the true intersection curves without any sorting required. The intersection curve is plotted by fitting an interpolatory cubic spline, and its refinement may include adding or deleting points. The method has been used to compute different planar sections for different derivationally continuous surfaces.