Approximation of discrete data by \(G^ 1\) arc splines
From MaRDI portal
Publication:1195289
DOI10.1016/0010-4485(92)90047-EzbMath0755.65010OpenAlexW2064582867MaRDI QIDQ1195289
Publication date: 26 October 1992
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4485(92)90047-e
algorithmsfittingarc splinebisection algorithmbiarcsdiscrete-data approximationlocally optimal approximations
Related Items (19)
Approximating smooth planar curves by arc splines ⋮ Circular spline fitting using an evolution process ⋮ Geometric Hermite interpolation with Tschirnhausen cubics ⋮ An arc spline approximation to a clothoid ⋮ Numerical methods for approximating digitized curves by piecewise circular arcs ⋮ Hermite interpolation with Tschirnhausen cubic spirals ⋮ Spiral transitions ⋮ Osculating conic biarcs ⋮ BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS ⋮ Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs ⋮ Planar osculating arc splines ⋮ Curve approximation by \(G^1\) arc splines with a limited number of types of curvature and length ⋮ The family of biarcs that matches planar, two-point \(G^{1}\) Hermite data ⋮ Circle reproduction with interpolatory curves at local maximal curvature points ⋮ Optimal arc spline approximation ⋮ Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions ⋮ Planar \(G^{1}\) Hermite interpolation with spirals ⋮ Spiral arc spline approximation to a planar spiral ⋮ Coaxing a planar curve to comply
This page was built for publication: Approximation of discrete data by \(G^ 1\) arc splines