BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
From MaRDI portal
Publication:3520431
DOI10.1142/S0218195908002593zbMath1147.65014MaRDI QIDQ3520431
Publication date: 26 August 2008
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
numerical examplesapproximationcurve fittingsimplificationoffsettingbiarcstangent-continuoustolerance band
Numerical smoothing, curve fitting (65D10) Complexity and performance of numerical algorithms (65Y20) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (3)
Deconstructing approximate offsets ⋮ Numerically robust computation of circular visibility ⋮ Optimal arc spline approximation
Cites Work
- Unnamed Item
- Approximation by fat arcs and fat biarcs
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A sweepline algorithm for Voronoi diagrams
- Optimal biarc-curve fitting
- Approximation of discrete data by \(G^ 1\) arc splines
- Circular splines
- On the computational geometry of pocket machining
- Curve fitting with arc splines for NC toolpath generation
- Data Approximation Using Biarcs
- Voronoi diagrams and offset curves of curvilinear polygons.
- Smooth biarc curves
- Approximating smooth planar curves by arc splines
- RANDOMIZATION YIELDS SIMPLE O(n log⋆ n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
This page was built for publication: BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
