Reconstruction of Low Degree B-spline Surfaces with Arbitrary Topology Using Inverse Subdivision Scheme

Author(s):  
Nga Le-Thi-Thu ◽  
Khoi Nguyen-Tan ◽  
Thuy Nguyen-Thanh

Multivariate B-spline surfaces over triangular parametric domain have many interesting properties in the construction of smooth free-form surfaces. This paper introduces a novel approach to reconstruct triangular B-splines from a set of data points using inverse subdivision scheme. Our proposed method consists of two major steps. First, a control polyhedron of the triangular B-spline surface is created by applying the inverse subdivision scheme on an initial triangular mesh. Second, all control points of this B-spline surface, as well as knotclouds of its parametric domain are iteratively adjusted locally by a simple geometric fitting algorithm to increase the accuracy of the obtained B-spline. The reconstructed B-spline having the low degree along with arbitrary topology is interpolative to most of the given data points after some fitting steps without solving any linear system. Some concrete experimental examples are also provided to demonstrate the effectiveness of the proposed method. Results show that this approach is simple, fast, flexible and can be successfully applied to a variety of surface shapes.

Author(s):  
Antonio Carminelli ◽  
Giuseppe Catania

This work considers the fitting of data points organized in a rectangular array to parametric spline surfaces. Point Based (PB) splines, a generalization of tensor product splines, are adopted. The basic idea of this paper is to fit large scale data with a tensorial B-spline surface and to refine the surface until a specified tolerance is met. Since some isolated domains exceeding tolerance may result, detail features on these domains are modeled by a tensorial B-spline basis with a finer resolution, superimposed by employing the PB-spline approach. The present method leads to an efficient model of free form surfaces, since both large scale data and local geometrical details can be efficiently fitted. Two application examples are presented. The first one concerns the fitting of a set of data points sampled from an interior car trim with a central geometrical detail. The second one refers to the modification of the tensorial B-spline surface representation of a mould in order to create a local adjustment. Considerations regarding strengths and limits of the approach then follow.


2018 ◽  
Vol 10 (11) ◽  
pp. 168781401880957 ◽  
Author(s):  
Dezhong Zhao ◽  
Wenhu Wang ◽  
Jinhua Zhou ◽  
Ruisong Jiang ◽  
Kang Cui ◽  
...  

Parts must be measured to evaluate the manufacturing accuracy in order to check whether their dimension is in expected tolerance. In engineering, parts with free-form surfaces are generally measured by high-precision coordinate-measuring machines. The measurement accuracy is usually improved by increasing the density of measurement points, which is time-consuming and costly. In this article, a novel sampling method of measurement points for free-form surface inspection is proposed. First, surface inspection is simplified into the inspection of a number of section curves of the surface. Second, B-spline curves constructed with an iterative method are employed to approximate these section curves. Subsequently, data points necessary to construct the B-spline curves are taken as the measurement points. Finally, the proposed method is compared with other two sampling methods. The results indicate that the proposed method greatly reduced the number of measurement points without decreasing the precision of surface modeling.


Author(s):  
Yunbao Huang ◽  
Xiaoping Qian

We present a divide-and-conquer method that efficiently finds a near-optimal distribution of sensing locations for free-form surface digitization. We formulate a next-best-point problem and transform the uncertainty of a B-spline surface into a higher-dimensional B-spline surface. This technique allows the use of the convex hull and subdivision properties of B-spline surfaces in the divide-and-conquer algorithm. It thus greatly reduces the search time for determining the next best sensing location.


2006 ◽  
Vol 505-507 ◽  
pp. 547-552 ◽  
Author(s):  
Ming June Tsai ◽  
Jing Jing Fang ◽  
Jian Feng Huang

This paper proposed a polishing path planning method of super accuracy mirror mold with free-form surface by curvature analysis. First, IGES files of free-form surfaces are read and the mold geometry is regenerated as B-spline surface by the Automatic Mold Polishing System (AMPS). By using the derivative properties of B-spline surface, normal vector and principal curvatures at any point of the surface are calculated. In addition, the effective contact width between polishing tool and mold surface based on the grain size and the principal radii of curvature is also determined. The minimum contact width in 3-D is mapped onto the (u, v) parameters of B-spline surface. Then a modified Peano fractal path with weaving function is calculated based on the effective contact width in the (u, v) coordinate. This Peano-weaving path was tested on an optical mold with free-form surface. The polishing result shows the method is very effective and achieves the level of mirror surface with roughness Ra 29nm.


Author(s):  
Hongshen Wang ◽  
Yurong Wang ◽  
Honghong Zhao ◽  
Jintang Yan

This paper studies the shape similarity evaluation of free-form surfaces expressed by B-spline with single curvature feature and proposes a similarity evaluation algorithm based on curvature feature. Firstly, we calculate the normal vector direction of the two surfaces compared, and use it as the Z axis, so that the two surfaces are aligned on the Z axis. Then, the two surfaces are cut with planes that all perpendicular to the Z axis, and the intersection sets of two surfaces are obtained respectively. Finally, we design the similarity algorithm of plane curves to realize the similarity comparison of corresponding curves in the two sets of intersection, and which is used as the basis for evaluating the similarity between two surfaces. The algorithm transforms the problem of similarity comparison between 3D surfaces into two dimensional space by plane cutting method, and reduces the complexity of the problem effectively. The algorithm only needs to align one coordinate axis in the process of posture adjustment, so it is easy to implement. In order to test the effect of the algorithm, simulation experiments on different type of single curvature feature B-spline surfaces are carried out. The results show that the proposed similarity comparison algorithm of free-form surfaces is feasible and effective.


Author(s):  
Joanna M. Brown ◽  
Malcolm I. G. Bloor ◽  
M. Susan Bloor ◽  
Michael J. Wilson

Abstract A PDE surface is generated by solving partial differential equations subject to boundary conditions. To obtain an approximation of the PDE surface in the form of a B-spline surface the finite element method, with the basis formed from B-spline basis functions, can be used to solve the equations. The procedure is simplest when uniform B-splines are used, but it is also feasible, and in some cases desirable, to use non-uniform B-splines. It will also be shown that it is possible, if required, to modify the non-uniform B-spline approximation in a variety of ways, using the properties of B-spline surfaces.


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.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
C. H. Garcia-Capulin ◽  
F. J. Cuevas ◽  
G. Trejo-Caballero ◽  
H. Rostro-Gonzalez

B-spline surface approximation has been widely used in many applications such as CAD, medical imaging, reverse engineering, and geometric modeling. Given a data set of measures, the surface approximation aims to find a surface that optimally fits the data set. One of the main problems associated with surface approximation by B-splines is the adequate selection of the number and location of the knots, as well as the solution of the system of equations generated by tensor product spline surfaces. In this work, we use a hierarchical genetic algorithm (HGA) to tackle the B-spline surface approximation of smooth explicit data. The proposed approach is based on a novel hierarchical gene structure for the chromosomal representation, which allows us to determine the number and location of the knots for each surface dimension and the B-spline coefficients simultaneously. The method is fully based on genetic algorithms and does not require subjective parameters like smooth factor or knot locations to perform the solution. In order to validate the efficacy of the proposed approach, simulation results from several tests on smooth surfaces and comparison with a successful method have been included.


Sign in / Sign up

Export Citation Format

Share Document