scholarly journals Hierarchical Genetic Algorithm for B-Spline Surface Approximation of Smooth Explicit Data

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
C. H. Garcia-Capulin ◽  
F. J. Cuevas ◽  
G. Trejo-Caballero ◽  
H. Rostro-Gonzalez
Keyword(s):  
Genetic Algorithm ◽  
Geometric Modeling ◽  
Data Set ◽  
Surface Approximation ◽  
B Spline ◽  
B Splines ◽  
Spline Surface ◽  
Spline Surfaces ◽  
Surface Dimension ◽  
Hierarchical Genetic Algorithm

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.

B-spline Surface Approximation Using Hierarchical Genetic Algorithm

2013 ◽  
pp. 52-63
Author(s):  
G. Trejo-Caballero ◽  
C. H. Garcia-Capulin ◽  
O. G. Ibarra-Manzano ◽  
J. G. Avina-Cervantes ◽  
L. M. Burgara-Lopez ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Surface Approximation ◽  
B Spline ◽  
Spline Surface ◽  
Hierarchical Genetic Algorithm

Generation and Modification of Non-Uniform B-Spline Surface Approximations to PDE Surfaces Using the Finite Element Method

1990 ◽  
Author(s):  
Joanna M. Brown ◽  
Malcolm I. G. Bloor ◽  
M. Susan Bloor ◽  
Michael J. Wilson
Keyword(s):  
Finite Element Method ◽  
Finite Element ◽  
Spline Approximation ◽  
The Finite Element Method ◽  
B Spline ◽  
B Splines ◽  
Spline Surface ◽  
Spline Surfaces ◽  
Spline Basis ◽  
Element Method

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.

scholarly journals Representation of 3D Environment Map Using B-Spline Surface with Two Mutually Perpendicular LRFs

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Rui-Jun Yan ◽  
Jing Wu ◽  
Ji Yeong Lee ◽  
Chang-Soo Han
Keyword(s):  
Point Cloud ◽  
Three Dimensional ◽  
Complex Problem ◽  
Experimental Result ◽  
Data Set ◽  
B Spline ◽  
Spline Surface ◽  
3D Environment ◽  
Spline Surfaces ◽  
Continuous Rotation

This paper proposes a map representation method of three-dimensional (3D) environment by using B-spline surfaces, which are first used to describe large environment in 3D map construction research. Initially, a 3D point cloud map is constructed based on extracted line segments with two mutually perpendicular 2D laser range finders (LRFs). Then two types of accumulated data sets are separated from the point cloud map according to different types of robot movements, continuous translation and continuous rotation. To express the environment more accurately, B-spline surface with covariance matrix is proposed to be extracted from each data set. Due to the random movements, there must be overlap between extracted B-spline surfaces. However, merging of two overlapping B-spline surfaces with different distribution directions of their control points is a complex problem, which is not well addressed by far. In our proposed method, each surface is divided into overlap and nonoverlap. Then generated sample points with propagated uncertainties from one overlap and their projection points located on the other overlap are merged using the product of Gaussian probability density functions. Based on this merged data set, a new surface is extracted to represent the environment instead of the two overlaps. Finally, proposed methods are validated by using the experimental result of an accurate representation of an indoor environment with B-spline surfaces.

scholarly journals Parallel Hierarchical Genetic Algorithm for Scattered Data Fitting through B-Splines

2019 ◽  
Vol 9 (11) ◽  
pp. 2336 ◽  
Author(s):  
Jose Edgar Lara-Ramirez ◽  
Carlos Hugo Garcia-Capulin ◽  
Maria de Jesus Estudillo-Ayala ◽  
Juan Gabriel Avina-Cervantes ◽  
Raul Enrique Sanchez-Yanez ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Curve Fitting ◽  
Fitness Function ◽  
Scattered Data ◽  
Model Parameters ◽  
B Spline ◽  
B Splines ◽  
Scattered Data Fitting ◽  
Data Points ◽  
Hierarchical Genetic Algorithm

Curve fitting to unorganized data points is a very challenging problem that arises in a wide variety of scientific and engineering applications. Given a set of scattered and noisy data points, the goal is to construct a curve that corresponds to the best estimate of the unknown underlying relationship between two variables. Although many papers have addressed the problem, this remains very challenging. In this paper we propose to solve the curve fitting problem to noisy scattered data using a parallel hierarchical genetic algorithm and B-splines. We use a novel hierarchical structure to represent both the model structure and the model parameters. The best B-spline model is searched using bi-objective fitness function. As a result, our method determines the number and locations of the knots, and the B-spline coefficients simultaneously and automatically. In addition, to accelerate the estimation of B-spline parameters the algorithm is implemented with two levels of parallelism, taking advantages of the new hardware platforms. Finally, to validate our approach, we fitted curves from scattered noisy points and results were compared through numerical simulations with several methods, which are widely used in fitting tasks. Results show a better performance on the reference methods.

A Local Approach for Computing Smooth B-spline Surfaces for Arbitrary Quadrilateral Base Meshes

2021 ◽  
pp. 1-28
Author(s):  
Dennis Mosbach ◽  
Katja Schladitz ◽  
Bernd Hamann ◽  
Hans Hagen
Keyword(s):  
Degrees Of Freedom ◽  
Tangent Plane ◽  
Local Approach ◽  
Approximation Process ◽  
Surface Approximation ◽  
B Spline ◽  
Spline Surfaces ◽  
Continuous Surface ◽  
Normal Vectors ◽  
The Individual

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.

Sequential B-Spline Surface Construction Using Multiresolution Data Clouds

2012 ◽  
Vol 12 (2) ◽  
Author(s):  
Yuan Yuan ◽  
Shiyu Zhou
Keyword(s):  
Control Points ◽  
Finite Sample ◽  
B Spline ◽  
Spline Surface ◽  
Spline Surfaces ◽  
Filtering Technique ◽  
Engineering Practices ◽  
Asymptotical Convergence ◽  
Surface Construction ◽  
Fitting Error

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.

Choosing the optimal number of B-spline control points (Part 2: Approximation of surfaces and applications)

2017 ◽  
Vol 11 (1) ◽  
Author(s):  
Corinna Harmening ◽  
Hans Neuner
Keyword(s):  
Data Analysis ◽  
Laser Scanner ◽  
Point Clouds ◽  
Optimal Number ◽  
Deformation Analysis ◽  
Control Points ◽  
Trial And Error ◽  
B Spline ◽  
B Splines ◽  
Spline Surfaces

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.

Filling N-Sided Holes With Trimmed B-Spline Surfaces Based on Energy-Minimization Method

2015 ◽  
Vol 15 (1) ◽  
Author(s):  
Xiaodong Liu
Keyword(s):  
Energy Minimization ◽  
Computer Aided Design ◽  
Control Points ◽  
Minimization Method ◽  
B Spline ◽  
Spline Surface ◽  
Spline Surfaces ◽  
Key Issues ◽  
Complex Constraints ◽  
Aided Design

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.

A New Method for Deformation of B-Spline Surfaces

2010 ◽  
Vol 139-141 ◽  
pp. 1260-1263
Author(s):  
Xian Guo Cheng ◽  
Wei Jun Liu
Keyword(s):  
Optimization Problem ◽  
Local Deformation ◽  
Geometric Constraints ◽  
Surface Patch ◽  
The Finite Element Method ◽  
B Spline ◽  
Spline Surface ◽  
Spline Surfaces ◽  
Single Force ◽  
External Forces

This paper presents an efficient method for deforming B-spline surfaces, based on the surface energy minimization. Firstly, using an analogy between the B-spline surface patch and the thin-plate element of the finite element method, and applying external forces on the surface with some given geometric constraints, the forces can locate on part of the surface or the surface. Then, the energy of the B-spline surface can change with the change of the forces. Finally, a new B-spline surface is generated by solving an optimization problem of change of the energy. The forces can be a single force, a distributed force and set of isolated force. The method can accomplish easily local deformation and total deformation of the B-spline surface.

Sign in / Sign up

Export Citation Format

Share Document