Computing nodes for plane data points by constructing cubic polynomial with constraints

DOI10.1016/J.CAGD.2024.102308MaRDI QIDQ6563925

Fan Zhang, Hua Wang

Publication date: 28 June 2024

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

zbMATH Keywords

quadratic polynomialaccuracycurveparameterizationshape of data

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Cites Work

• Title not available (Why is that?)
• Curves with chord length parameterization
• An approach to data parametrization in parametric cubic spline interpolation problems
• Intrinsic parametrization for approximation
• Choosing nodes in parametric curve interpolation
• A method for determining knots in parametric curve interpolation
• Parameterization for polynomial curve approximation via residual deep neural networks
• Optimal parametric interpolants of circular arcs
• Approximation of monotone clothoid segments by degree 7 Pythagorean-hodograph curves
• An improved Hoschek intrinsic parametrization
• Target curvature driven fairing algorithm for planar cubic B-spline curves
• Improving angular speed uniformity by reparameterization
• The \(G^2\) and \(C^2\) rational quadratic trigonometric Bézier curve with two shape parameters with applications
• Meshless parameterization and surface reconstruction

This page was built for publication: Computing nodes for plane data points by constructing cubic polynomial with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563925)