COMPLEXITY REDUCTION FOR SYMBOLIC COMPUTATION WITH RATIONAL B-SPLINES
From MaRDI portal
Publication:3503022
DOI10.1142/S0218654307000932zbMath1142.68571OpenAlexW2043964987MaRDI QIDQ3503022
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen
Publication date: 20 May 2008
Published in: International Journal of Shape Modeling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218654307000932
torsiondegree reductionevolutezero curvaturebisector surfacetangent developablerectifying developablenormal scrollcritical curvaturefocal curvebinormal scrollbisector curveNURBS symbolic computation
Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Some identities for product and degree raising of splines
- Knot removal for parametric B-spline curves and surfaces
- Algorithms for polynomials in Bernstein form
- Computation of the solutions of nonlinear polynomial systems
- The bisector of a point and a plane parametric curve
- Algorithm for degree reduction of \(B\)-spline curves
- Topologically reliable approximation of composite Bézier curves
- Bisector curves of planar rational curves.
- Analytic properties of plane offset curves
- ERROR BOUNDED VARIABLE DISTANCE OFFSET OPERATOR FOR FREE FORM CURVES AND SURFACES
- Functional composition algorithms via blossoming
- Second-order surface analysis using hybrid symbolic and numeric operators