Parametric Spiral And Its Application As Transition Curve

Lengkung Bezier merupakan suatu perwakilan lengkungan yang paling popular digunakan di dalam applikasi Rekabentuk Berbantukan Komputer (RBK) dan Rekabentuk Geometrik Berbantukan Komputer (RGBK). The Bezier curve representation is frequently utilized in computer-aided design (CAD) and computer-aided geometric design (CAGD) applications. The curve is defined geometrically, which means that the parameters have geometric meaning; they are just points in three-dimensional space

www.elsevier.com/locate/cagd A local fitting algorithm for converting planar curves to B-splines

In this paper we present a local fitting algorithm for converting smooth planar curves to B-splines. For a smooth planar curve a set of points together with their tangent vectors are first sampled from the curve such that the connected polygon approximates the curve with high accuracy and inflexions are detected by the sampled data efficiently. Then, a G1 continuous Bézier spline curve is obtained by fitting the sampled data with shape preservation as well as within a prescribed accuracy. Finally, the Bézier spline is merged into a C2 continuous B-spline curve by subdivision and control points adjustment. The merging is guaranteed to be within another error bound and with no more inflexions than the Bézier spline. In addition to shape preserving and error control, this conversion algorithm also benefits that the knots are selected automatically and adaptively according to local shape and error bound. A few experimental results are included to demonstrate the validity and efficiency of the algorithm

Convexity preserving interpolatory subdivision with conic precision

The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic sections and respects the convexity properties of the initial data. Significant numerical examples illustrate the effectiveness of the proposed method

A convexity test for control point based curves

We study the convexity of curves defined by the combination of control points and blending functions, that are globally controlled. We provide a method using which the convexity of the curve can be determined by the location of one of its control points