In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors...In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors between PH-spline and the Bzier curve, the offset to PH-spline and the offset to the given Bzier curve are also estimated. A new algorithm for constructing offset to the Bzier curve is proposed.展开更多
This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit ...This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit circular arc first, then accurately to represent it as a rational curve, and finally to reparameterize it in a particular way to approximate the offset. Examples illustrated that the algorithm yields fewer curve segments and control points as well as C^1 continuity, and so has much significance in terms of saving computing time, reducing the data storage and smoothing curves entirely.展开更多
文摘In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors between PH-spline and the Bzier curve, the offset to PH-spline and the offset to the given Bzier curve are also estimated. A new algorithm for constructing offset to the Bzier curve is proposed.
基金Supported by the National Natural Science Foundation of China (6093300760873111)
文摘This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit circular arc first, then accurately to represent it as a rational curve, and finally to reparameterize it in a particular way to approximate the offset. Examples illustrated that the algorithm yields fewer curve segments and control points as well as C^1 continuity, and so has much significance in terms of saving computing time, reducing the data storage and smoothing curves entirely.
