A reliable method for finding intersections of 2D NURBS curves
From MaRDI portal
Cites work
- A Cox-de Boor-type recurrence relation for C^1 multi-degree splines
- A method for the solution of certain non-linear problems in least squares
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An Algorithm for the Intersection Problem of Planar Parametric Curves
- Bézier clipping is quadratically convergent
- Certified numerical real root isolation for bivariate nonlinear systems
- Computing roots of polynomials by quadratic clipping
- Constructing high-quality planar NURBS parameterization for isogeometric analysis by adjustment control points and weights
- Curve intersection using Bézier clipping
- Effective subdivision algorithm for isolating zeros of real systems of equations, with complexity analysis
- Fast approach for computing roots of polynomials using cubic clipping
- Hierarchical geometric models for visible surface algorithms
- Hodographs and normals of rational curves and surfaces
- scientific article; zbMATH DE number 1716506 (Why is no real title available?)
- scientific article; zbMATH DE number 981250 (Why is no real title available?)
- scientific article; zbMATH DE number 3397374 (Why is no real title available?)
- Loop detection in surface patch intersections
- On calculating with B-splines
- Rational hodographs
- The Poincare-Miranda Theorem
This page was built for publication: A reliable method for finding intersections of 2D NURBS curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295129)
