Computer Aided Geometric Design - Special issue: Topics in CAGD
Loop detection in surface patch intersections
Computer Aided Geometric Design
Curves and surfaces for computer aided geometric design
Curves and surfaces for computer aided geometric design
The generalized inverse matrix and the surface-surface intersection problem
Theory and practice of geometric modeling
Using plane vector fields to obtain all the intersection curves of two general surfaces
Theory and practice of geometric modeling
Estimating subdivision depths for rational curves and surfaces
ACM Transactions on Graphics (TOG)
A parallel multistage method for surface/surface intersection
Selected papers of the international symposium on Free-form curves and free-form surfaces
Surface intersection using parallelism
Computer Aided Geometric Design
Hodographs and normals of rational curves and surfaces
Computer Aided Geometric Design
An efficient surface intersection algorithm based on lower-dimensional formulation
ACM Transactions on Graphics (TOG)
A new approach to the surface intersection problem
Computer Aided Geometric Design
Differential geometry of intersection curves of two surfaces
Computer Aided Geometric Design
Computing normal vector Bézier patches
Computer Aided Geometric Design - Pierre Bézier
Solving systems of algebraic equations
Machine Graphics & Vision International Journal
Solving systems of algebraic equations
Machine Graphics & Vision International Journal
| Hi-index | 0.00 |
A procedure of finding the intersection of rational patches is developed. It consists of adaptive division of the patches, convex hull test to reject pairs of disjoint pieces, normal vectors test that verifies some condition ensuring a simple enough shape of the pieces, computing end points of common arcs (described in a separate paper, [20]) and computing other points using the Newton method with pseudo-inversion. Some issues concerning the reliability of this procedure are discussed.