Optimal arc spline approximation
From MaRDI portal
Publication:2513780
DOI10.1016/j.cagd.2014.02.011zbMath1308.65026OpenAlexW2086776041MaRDI QIDQ2513780
Publication date: 29 January 2015
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2014.02.011
Related Items (2)
Numerically robust computation of circular visibility ⋮ Curve approximation by \(G^1\) arc splines with a limited number of types of curvature and length
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
- Approximation of discrete data by \(G^ 1\) arc splines
- Data Approximation Using Biarcs
- A linear-time algorithm for constructing a circular visibility diagram
- Approximating smooth planar curves by arc splines
- Approximation of a closed polygon with a minimum number of circular arcs and line segments
- Chebyshev approximation by spline functions with free knots
- Visual Quality Control of Planar Working Pieces: A Curve Based Approach Using Prototype Fitting
- BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
- Zur Geometrie der Korbbögen .
- Set-valued analysis
This page was built for publication: Optimal arc spline approximation
