Automatic Fairing of Two-parameter Rational B-spline Motion
نویسندگان
چکیده
This paper deals with the problem of automatic fairing of two-parameter B-Spline spherical and spatial motions. The concept of two-parameter freeform motions brings together the notion of the analytically determined two-parameter motions in Theoretical Kinematics and the concept of freeform surfaces in the field of Computer Aided Geometric Design (CAGD). A dual quaternion representation of spatial displacements is used and the problem of fairing two-parameter motions is studied as a surface fairing problem in the space of dual quaternions. By combining the latest results in surface fairing from the field of CAGD and computer aided synthesis of freeform rational motions, smoother (C3 continuous) two-parameter rational BSpline motions are generated. The results presented in this paper are extensions of previous results on fine-tuning of oneparameter B-spline motions. The problem of motion smoothing has important applications in the Cartesian motion planning, camera motion synthesis, spatial navigation in visualization, and virtual reality systems. Several examples are presented to illustrate the effectiveness of the proposed method.
منابع مشابه
Fairing Bicubic B-Spline Surfaces using Simulated Annealing
In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smoothes the surface. The simulated-annealing search strategy is used to search for the global minimum of the fairing measure.
متن کاملLocal Energy Fairing of B-spline Curves
An automatic algorithm for fairing B-spline curves of general order is presented. This work was motivated by a method of Farin and Sapidis about fairing planar cubic B-spline curves by subsequently removing and reinserting knots. Instead our new algorithm is based on the idea of subsequently changing one control point of a given B-spline curve so that the new curve minimizes the integral of the...
متن کاملKnot-removal surface fairing using search strategies
This paper presents two automatic fairing algorithms for parametric C-continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smooths the surface. Search strategies like best-first-search and simulated-annealing are searching for the global minimum of the fairing measure. The best-first-search algorithm constructs only partial...
متن کاملTarget Curvature Based Automatic Fairing of Planar B-Spline Curves
A new automatic local fairing technique for planar B-spline curves is presented in this paper. According to the design intent, a target curvature plot, which is provided by the designer, is used to identify ‘bad’ points and ‘bad’ curve segments. Then, the corresponding control points are modified in a process of local constrained optimization where the importance of fairness in the sense of ene...
متن کاملFast and Local Fairing of B-Spline Curves and Surfaces
The paper proposes a fast fairing algorithm for curves and surfaces. It rst de nes a base algorithm for fairing curves, which is then extended to the surface case, where the isocurves of the surface are faired. The curve fairing process involves the discrete integration of a pseudo-arc-length parameterization of B-spline curves, with a blending and tting phase concluding the algorithm. In the c...
متن کامل