Geometric Design of Uniform Developable B-Spline Surfaces

Author(s):  
Chih-Hsing Chu ◽  
Jang-Ting Chen

This paper studies geometric design of uniform developable B-spline surfaces from two boundary curves. The developability constraints are geometrically derived from the de Boor algorithm and expressed as a set of equations that must be fulfilled by the B-spline control points. These equations help characterize the number of degrees of freedom (DOF’s) for the surface design. For a cubic B-spline surface with a first boundary curve freely chosen, five more DOF’s are available for a second boundary curve when both curves contain four control points. There remain (7-2m) DOF’s for a cubic surface consisting of m consecutive patches with C2 continuity. The results are in accordance with previous findings for equivalent composite Be´zier surfaces. Test examples are illustrated to demonstrate design methods that fully utilize the DOF’s without leading to over-constrained systems in the solution process. Providing a foundation for systematic implementation of a CAGD system for developable B-spline surfaces, this work has substantial improvements over past studies.

Author(s):  
Chih-Hsing Chu

This paper investigates the number of degrees of freedom for geometric design of developable Be´zier surfaces. The conditions for developability are derived geometrically from the de Casteljau algorithm and expressed as a set of equations that must be fulfilled by the Be´zier control points. This set of equations enables us to infer important properties of developable Be´zier patches that characterize the patch design and simplify its solution process. With one boundary curve freely specified in 3D space, five more degrees of freedom are available for the second boundary curve of the same degree. Imposing parametric or geometric continuities across the boundary of two adjacent developable Be´zier patches results in a composite developable Be´zier surface that has fewer degrees of freedom. This work provides the foundation for a systematic implementation of a computer-aided design system for developable Be´zier surfaces.


Author(s):  
Dennis Mosbach ◽  
Katja Schladitz ◽  
Bernd Hamann ◽  
Hans Hagen

Abstract We present a method for approximating surface data of arbitrary topology by a model of smoothly connected B-spline surfaces. Most of the existing solutions for this problem use constructions with limited degrees of freedom or they address smoothness between surfaces in a post-processing step, often leading to undesirable surface behavior in proximity of the boundaries. Our contribution is the design of a local method for the approximation process. We compute a smooth B-spline surface approximation without imposing restrictions on the topology of a quadrilateral base mesh defining the individual B-spline surfaces, the used B-spline knot vectors, or the number of B-spline control points. Exact tangent plane continuity can generally not be achieved for a set of B-spline surfaces for an arbitrary underlying quadrilateral base mesh. Our method generates a set of B-spline surfaces that lead to a nearly tangent plane continuous surface approximation and is watertight, i.e., continuous. The presented examples demonstrate that we can generate B-spline approximations with differences of normal vectors along shared boundary curves of less than one degree. Our approach can also be adapted to locally utilize other approximation methods leading to higher orders of continuity.


Author(s):  
Yuan Yuan ◽  
Shiyu Zhou

B-spline surfaces are widely used in engineering practices as a flexible and efficient mathematical model for product design, analysis, and assessment. In this paper, we propose a new sequential B-spline surface construction procedure using multiresolution measurements. At each iterative step of the proposed procedure, we first update knots vectors based on bias and variance decomposition of the fitting error and then incorporate new data into the current surface approximation to fit the control points using Kalman filtering technique. The asymptotical convergence property of the proposed procedure is proved under the framework of sieves method. Using numerical case studies, the effectiveness of the method under finite sample is tested and demonstrated.


1994 ◽  
Vol 6 (6) ◽  
pp. 491-498 ◽  
Author(s):  
Hiroaki Ozaki ◽  
◽  
Hua Chiu ◽  

A basic optimization algorithm is presented in this paper, in order to obtain the optimum solution of a two-point boundary value variational problem without constraints. The solution is given by a parallel and iterative computation and described as a set of control points of a uniform B-spline. This algorithm can also be applied to solving problems with some constraints, if we introduce an additional component, namely the potential function, corresponding to constraints in the original objective function. The algorithm is very simple and easily applicable to various engineering problems. As an application, trajectory planning of a manipulator with redundant degrees of freedom is considered under the conditions that the end effector path, the smoothness of movement, and the constraints of the control or the state variables are specified. The validity of the algorithm is well confirmed by numerical examples.


2017 ◽  
Vol 11 (1) ◽  
Author(s):  
Corinna Harmening ◽  
Hans Neuner

AbstractFreeform surfaces like B-splines have proven to be a suitable tool to model laser scanner point clouds and to form the basis for an areal data analysis, for example an areal deformation analysis.A variety of parameters determine the B-spline's appearance, the B-spline's complexity being mostly determined by the number of control points. Usually, this parameter type is chosen by intuitive trial-and-error-procedures.In [The present paper continues these investigations. If necessary, the methods proposed in [The application of those methods to B-spline surfaces reveals the datum problem of those surfaces, meaning that location and number of control points of two B-splines surfaces are only comparable if they are based on the same parameterization. First investigations to solve this problem are presented.


2018 ◽  
Vol 12 (2) ◽  
pp. 157-167 ◽  
Author(s):  
Julia Aichinger ◽  
Volker Schwieger

Abstract This contribution deals with the influence of scanning parameters like scanning distance, incidence angle, surface quality and sampling width on the average estimated standard deviations of the position of control points from B-spline surfaces which are used to model surfaces from terrestrial laser scanning data. The influence of the scanning parameters is analyzed by the Monte Carlo based variance analysis. The samples were generated for non-correlated and correlated data, leading to the samples generated by Latin hypercube and replicated Latin hypercube sampling algorithms. Finally, the investigations show that the most influential scanning parameter is the distance from the laser scanner to the object. The angle of incidence shows a significant effect for distances of 50 m and longer, while the surface quality contributes only negligible effects. The sampling width has no influence. Optimal scanning parameters can be found in the smallest possible object distance at an angle of incidence close to 0° in the highest surface quality. The consideration of correlations improves the estimation accuracy and underlines the importance of complete stochastic models for TLS measurements.


Author(s):  
Xiaodong Liu

Using a trimmed rectangular B-Spline surface to fill an n-sided hole is a much desired operation in computer aided design (CAD), but few papers have addressed this issue. Based on an energy-minimization or variational B-Spline technique, the paper presents the technique of using one single trimmed rectangular B-Spline surface to fill an n-sided hole. The method is efficient and robust, and takes a fraction of a second to fill n-sided holes with high-quality waterproof B-Spline surfaces under complex constraints. As the foundation of filling n-sided holes, the paper also presents the framework and addresses the key issues on variational B-Spline technique. Without any precalculation, the variational B-Spline technique discussed in this paper can solve virtually any B-Spline surface with up to 20,000 control points in real time, which is much more efficient and powerful than previous work in the variational B-Spline field. Moreover, the result is accurate and satisfies CAD systems' high-precision requirements.


Author(s):  
Xiaodong Liu

Using one single trimmed B-Spline surface to fill an n-sided hole is a much desired operation in CAD, but few papers have addressed this issue. The paper presents the method of using trimmed B-Spline surfaces to fill n-sided holes based on energy minimization or variational technique. The method is efficient and robust, and takes less than one second to fill n-sided holes with high quality B-Spline surfaces under complex constraints. As the foundation of filling n-sided holes, some key issues on variational B-Spline technique are also discussed. The variational technique discussed is significantly much more efficient and powerful than previous research, and the result is very accurate to satisfy CAD systems’ high-precision requirements. We demonstrate that, without any pre-calculation, the discussed technique is efficient enough to solve a B-Spline surface with up to 20,000 control points in real time while satisfying an arbitrary combination of point and curve constraints.


Author(s):  
Yifan Chen ◽  
Klaus-Peter Beier

Abstract A new interactive technique for B-spline surface quality visualization and improvement, called the B2 method, is presented. This method interpolates the control points of a given B-spline surface using a second B-spline surface. If small irregularities exist in the control points of the original surface, they will be magnified through the second B-spline and demonstrated as large distortions in its control points. This facilitates the detection of small surface irregularities. Subsequently, the surface may be improved through direct and interactive adjustment of the second B-spline’s control polyhedron.


Sign in / Sign up

Export Citation Format

Share Document