Choosing nodes in parametric curve interpolation
From MaRDI portal
Let be given a set of points \(P_ k=(x_ k,y_ k)\) \((k=1,...,n)\) in the plane and let \(x_ 1<...<x_ n\) not necessarily be valid. Parametric curve interpolation means to choose parameters \(0=t_ 1<t_ 2<...<t_ n\) and functions \(x=x(t)\) and \(y=y(t)\) such that \(P(t)=(x(t),y(t))\) passes through the given points. The problem is considered how to choose the \(t_ k\). Postponing a normalization \(t_ 1+t_ 2+...+t_ n=1\) the usual choice is \(t_ k=t_{k-1}+d_ k\) where \(d_ k=((x_ k-x_{k-1})^ 2+(y_ k-y_{k-1})^ 2)^{1/2}\) \((k=2,...,n)\). Using a centripedal model the author motivates the choice \(t_ k=t_{k-1}+d^ p_ k\) with \(p=1/2\) and shows (also varying p between 0 and 1) for a number of examples that he gets visually more pleasant curves than for \(p=1\).
Recommendations
Cited in
(60)- Constructing parametric quadratic curves
- Parametric approximation of data using ODR splines
- Minimization, constraints and composite Bézier curves
- Approaches for constrained parametric curve interpolation
- A method for determining knots in parametric curve interpolation
- High quality local interpolation by composite parametric surfaces
- Learnt knot placement in B-spline curve approximation using support vector machines
- Surface-based geological reservoir modelling using grid-free NURBS curves and surfaces
- A sharp interface isogeometric solution to the Stefan problem
- \(C^ 1\) comonotone Hermite interpolation via parametric cubics
- Parameterization method on B-spline curve
- Point data reconstruction and smoothing using cubic splines and clusterization
- Parameterization for polynomial curve approximation via residual deep neural networks
- Quasi-elastic cubic splines in \(\mathbb{R}^d\)
- A 2D chaotic path planning for mobile robots accomplishing boundary surveillance missions in adversarial conditions
- A modified Hermite interpolation with exponential parameterization
- A discussion on relationships between minimal energy and curve shapes
- Constrained variational refinement
- An improved Hoschek intrinsic parametrization
- Lifting curve parameterization methods to isosurfaces
- Determining knots by optimizing the bending and stretching energies
- Non-uniform interpolatory subdivision surface
- A new subdivision based approach for piecewise smooth approximation of 3D polygonal curves
- Arc length estimation and the convergence of polynomial curve interpolation
- Surface skinning using periodic T-spline in semi-NURBS form
- Exponential parameterization to fit reduced data
- Uncertainty quantification and estimation of closed curves based on noisy data
- Control point reduction for lofted B-spline surface interpolation based on serial closed contours
- scientific article; zbMATH DE number 4198712 (Why is no real title available?)
- Computing surface area and volume of parachutes from 3D scans
- scientific article; zbMATH DE number 4109289 (Why is no real title available?)
- Existence of free nonclosed Euler–Bernoulli elastica
- The best parameter for parametric interpolation
- scientific article; zbMATH DE number 1358053 (Why is no real title available?)
- scientific article; zbMATH DE number 1438950 (Why is no real title available?)
- Convergence order in trajectory estimation by piecewise-cubics and exponential parameterization
- Numerical and analytical method for the design of piezoelectric modal sensors/actuators for shell‐type structures
- Quadratic B-spline curve interpolation
- Four-point curve subdivision based on iterated chordal and centripetal parameterizations
- Determining tension parameters in rational gamma-spline interpolation
- Planar cubic \(G^{1}\) interpolatory splines with small strain energy
- Handling noise and overfitting in surrogate models based on non-uniform rational basis spline entities
- Computing nodes for plane data points by constructing cubic polynomial with constraints
- Non-uniform interpolatory curve subdivision with edge parameters built upon compactly supported fundamental splines
- Randomized progressive iterative approximation for B-spline curve and surface fittings
- A certified cubic B-spline interpolation method with tangential direction constraints
- A neural network transformation based global optimization algorithm
- Interpolation of curve data by blended generalized circles
- Neural network methods for NURBS curve and surface interpolation
- Construction of interpolating space curves with arbitrary degree of geometric continuity
- A spatially fourth-order Cartesian grid method for fast solutions of elliptic and parabolic problems on irregular domains with sharply curved boundaries
- A generalized isogeometric-analysis-based method for assembly accuracy prediction considering non-ideal surface morphology and part deformation
- A general formulation of reweighted least squares fitting
- On adaptive sampling techniques for metamodels based on NURBS entities from unstructured data
- GL-k curves: a family of polynomial curves for intuitive modelling
- On the deviation of a parametric cubic spline interpolant from its data polygon
- A note on modified Hermite interpolation
- A fast solver for boundary integral equations of the modified Helmholtz equation
- Piecewise-quadratics and exponential parameterization for reduced data
- On parametrization of interpolating curves
This page was built for publication: Choosing nodes in parametric curve interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122288)
