On computing the intersection of B-splines (extended abstract)

Authors:
B. K. Natarajan
Affiliations:
Hewlett Packard Laboratories, 1501, Page Mill Road, Palo Alto, CA
Venue:
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Year:
1990

Citing 5
Cited 1

Surface algorithms using bounds on derivatives

Computer Aided Geometric Design
An introduction to splines for use in computer graphics & geometric modeling

An introduction to splines for use in computer graphics & geometric modeling
Surface/surface intersection

Computer Aided Geometric Design - Special issue: Topics in CAGD
Genus of the intersection curve of two rational surface patches

Computer Aided Geometric Design
Tracing surface intersections

Computer Aided Geometric Design

A surface intersection algorithm based on loop detection

SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of computing a piecewise linear approximation to the intersection of a pair of tensor product B-spline surfaces in 3-space. The problem is rather central in solid modeling. We present a fast and robust divide-and-conquer algorithm for the problem, that is a generalization of the bisection algorithm for computing the roots of non-linear equations. The algorithm is guaranteed to solve a “nearby” problem, and our analysis proves that its expected run-time is linear in the worst-case size of the output. To our knowledge, this is the first such analysis, resulting in the first provably efficient algorithm for the problem.