Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
From MaRDI portal
Publication:934021
DOI10.1016/j.comgeo.2007.10.009zbMath1160.68041OpenAlexW2009210603MaRDI QIDQ934021
Günter Rote, Astrid Sturm, Robert L. Scot Drysdale
Publication date: 29 July 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.009
Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (6)
Deconstructing approximate offsets ⋮ Approximation of color images based on the clusterization of the color palette and smoothing boundaries by splines and arcs ⋮ Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere ⋮ Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs ⋮ COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION ⋮ Optimal arc spline approximation
Cites Work
- Unnamed Item
- 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
- Curve fitting with arc splines for NC toolpath generation
- A note on approximation of discrete data by \(G^1\) arc splines.
- Smooth biarc curves
- Approximating quadratic NURBS curves by arc splines
- Approximating smooth planar curves by arc splines
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
This page was built for publication: Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs