Computing intersections of planar spline curves using knot insertion
From MaRDI portal
Publication:625188
DOI10.1016/J.CAGD.2008.07.005zbMath1205.65125OpenAlexW1981024031MaRDI QIDQ625188
Christian Schulz, Martin Reimers, Knut M. Mørken
Publication date: 15 February 2011
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2008.07.005
Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (3)
Conditions for the coincidence of two quartic Bézier curves ⋮ Conditions for coincidence of two cubic Bézier curves ⋮ Granular element method for computational particle mechanics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bézier clipping is quadratically convergent
- Curve intersection using Bézier clipping
- Subdivision methods for solving polynomial equations
- Best bounds on the approximation of polynomials and splines by their control structure
- An unconditionally convergent method for computing zeros of splines and polynomials
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
This page was built for publication: Computing intersections of planar spline curves using knot insertion