This paper introduces the definition of the Orthogonal Type Node Configuration and discusses the corresponding multivariate Lagrange, Hermite and Birkhoff interpolation problems in high dimensional space R s(s>2). ...This paper introduces the definition of the Orthogonal Type Node Configuration and discusses the corresponding multivariate Lagrange, Hermite and Birkhoff interpolation problems in high dimensional space R s(s>2). This node configuration can be considered to be a kind of extension of the Cross Type Node Configuration , in R 2 to high dimensional spaces. And the Mixed Type Node Configuration in R s(s>2) is also discussed in this paper in an example.展开更多
An efficient MPI/OpenMP hybrid parallel Radial Basis Function (RBF) strategy for both continuous and discontinuous large-scale mesh deformation is proposed to reduce the computational cost and memory consumption.Unlik...An efficient MPI/OpenMP hybrid parallel Radial Basis Function (RBF) strategy for both continuous and discontinuous large-scale mesh deformation is proposed to reduce the computational cost and memory consumption.Unlike the conventional parallel methods in which all processors use the same surface displacement and implement the same operation,the present method employs different surface points sets and influence radius for each volume point movement,accompanied with efficient geometry searching strategy.The deformed surface points,also called Control Points (CPs),are stored in each processor.The displacement of spatial points is interpolated by using only 20-50 nearest control points,and the local influence radius is set to 5-20 times the maximum displacement of control points.To shorten the searching time for the nearest control point clouds,an Alternating Digital Tree (ADT) algorithm for 3D complex geometry is designed based on an iterative bisection technique.Besides,an MPI/OpenMP hybrid parallel approach is developed to reduce the memory cost in each High-Performance Computing (HPC) node for large-scale applications.Three 3D cases,including the ONERA-M6 wing and a commercial transport airplane standard model with up to 2.5 billion hybrid elements,are used to test the present mesh deformation method.The robustness and high parallel efficiency are demonstrated by a wing deflection case with a maximum bending angle of 450 and more than 80% parallel efficiency with 1024 MPI processors.In addition,the availability for both continuous and discontinuous surface deformation is verified by interpolating the projecting displacement with opposite directions surface points to the spatial points.展开更多
The sea surface height data volume of the future wide-swath two-dimensional(2D)altimetric satellite is thousands of times greater than that of nadir altimetric satellites.The time complexity of the 2D altimetry mappin...The sea surface height data volume of the future wide-swath two-dimensional(2D)altimetric satellite is thousands of times greater than that of nadir altimetric satellites.The time complexity of the 2D altimetry mapping reaches O(n^(3)).It is challenging to map the global grid products of future 2D altimetric satellites.In this study,to improve the efficiency of global data mapping,a new algorithm called parallel-dynamic interpolation(PA-DI)was designed.Through the use of 2D data segmentation and fine-grained data mosaic methods,the parallel along-track DI processes were accelerated,and a fast and efficient spatial-temporal high-resolution and low-error enhanced mapping method was obtained.As determined from a comparison of the single-threaded DI with the PA-DI,the new algorithm optimized the time complexity from O(n^(3))to O(n^(3)/KL),which improved the mapping efficiency and achieved the expected results.According to the test results of the observing system simulation experiments,the PA-DI algorithm may provide an efficient and reliable method for future wide-swath 2D altimetric satellite mapping.展开更多
Aiming at the problem of low accuracy of interpolation error calculation of existing NURBS curves, an approximate method for the distance between a point and a NURBS interpolation curve is proposed while satisfying th...Aiming at the problem of low accuracy of interpolation error calculation of existing NURBS curves, an approximate method for the distance between a point and a NURBS interpolation curve is proposed while satisfying the accuracy of the solution. Firstly, the minimum parameter interval of the node vector corresponding to the data point under test in the original data point sequence is determined, and the parameter interval is subdivided according to the corresponding step size, and the corresponding parameter value is obtained. Secondly, the distance from the measured point to the NURBS curve is calculated, and the nearest distance is found out. The node interval is subdivided again on one side of the nearest distance. Finally, the distance between the data point to be measured and each subdivision point is calculated again, and the minimum distance is taken as the interpolation error between the point and the NURBS curve. The simulation results of actual tool position data show that this method can more accurately obtain the error of spatial NURBS interpolation curve.展开更多
This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By u...This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By using space sparse sampling, great memorial capacity can be saved and reproduced scenes can be controlled. To solve time consuming and complex computations in three-dimensional interpolation algorithm, we have studied a fast and practical algorithm of scattered space lattice and that of 'Warp' algorithm with proper depth. By several simple aspects of three dimensional space interpolation, we succeed in developing some simple and practical algorithms. Some results of simulated experiments with computers have shown that the new method is absolutely feasible.展开更多
Driven by the ever increasing demand in function integration,more and more next generation high value-added products,such as head-up displays,solar concentrators and intra-ocular-lens,etc.,are designed to possess free...Driven by the ever increasing demand in function integration,more and more next generation high value-added products,such as head-up displays,solar concentrators and intra-ocular-lens,etc.,are designed to possess freeform(i.e.,non-rotational symmetric)surfaces.The toolpath,composed of high density of short linear and circular segments,is generally used in computer numerical control(CNC)systems to machine those products.However,the discontinuity between toolpath segments leads to high-frequency fluctuation of feedrate and acceleration,which will decrease the machining efficiency and product surface finish.Driven by the ever-increasing need for high-speed high-precision machining of those products,many novel toolpath interpolation and smoothing approaches have been proposed in both academia and industry,aiming to alleviate the issues caused by the conventional toolpath representation and interpolation methods.This paper provides a comprehensive review of the state-of-the-art toolpath interpolation and smoothing approaches with systematic classifications.The advantages and disadvantages of these approaches are discussed.Possible future research directions are also offered.展开更多
The finite analytic method (FA) developed in the last decade is an effective numerical method for solving fluid flow problems. However, because of the limitation in the present computer, large round-off errors are fou...The finite analytic method (FA) developed in the last decade is an effective numerical method for solving fluid flow problems. However, because of the limitation in the present computer, large round-off errors are found in calculating FA coefficients when Reynolds number is large. This paper investigates the cause of this difficulty and presents a special programming technique in making an accurate computation of FA coefficients. Then a fundamental function known as 'Pe' is tabulated by the accurate computation. In practical application the interpolation technique is employed so that the FA coefficients can be obtained reliably and quickly.展开更多
In simulation,sometimes we wish to stipulate a specified angular velocity applied to a given frame.Although position,linear velocity and orientation interpolations are well studied,less attention is paid on angular ve...In simulation,sometimes we wish to stipulate a specified angular velocity applied to a given frame.Although position,linear velocity and orientation interpolations are well studied,less attention is paid on angular velocity interpolation.In this paper,a new method to smoothly interpolate angular velocity using quaternions is presented.This method can be easily incorporated into a key frame animation system.The angular velocity at an arbitrary time can be calculated easily by our method.This method can also be generalized to smoothly interpolate orientations.展开更多
Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be...Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be recognized as data living on mani- fold surfaces. So interpolation and approximation for these data are of general interest. This paper presents two approaches for mani- fold data interpolation and approximation through the properties of Laplace-Beltrami operator （Laplace operator defined on a mani- fold surface）. The first one is to use Laplace operator minimizing the membrane energy of a scalar function defined on a manifold. The second one is to use bi-Laplace operator minimizing the thin plate energy of a scalar function defined on a manifold. These two approaches can process data living on high genus meshed surfaces. The approach based on Laplace operator is more suitable for manifold data approximation and can be applied manifold data smoothing, while the one based on bi-Laplace operator is more suit- able for manifold data interpolation and can be applied image extremal envelope computation. All the application examples demon- strate that our procedures are robust and efficient.展开更多
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of...In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.展开更多
This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precisio...This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precision and the shape of the interpolation surface. An approach to determining the freedom degrees is given, the continuity equations for constructing C2 quartic spline curve are discussed, and a new method for constructing C2 quartic spline surface is presented. The advantages of the new method are that the equations that the surface has to satisfy are strictly row diagonally dominant, and the discontinuous points of the surface are at the given data points. The constructed surface has the precision of quartic polynomial. The comparison of the interpolation precision of the new method with cubic and quartic spline methods is included.展开更多
The regularized image interpolation method is widely used based on the vector interpolation model in which down-sampling matrix has very large dimension and needs large storage consumption and higher computation compl...The regularized image interpolation method is widely used based on the vector interpolation model in which down-sampling matrix has very large dimension and needs large storage consumption and higher computation complexity. In this paper, a fast algorithm for image interpolation based on the tensor product of matrices is presented, which transforms the vector interpolation model to matrix form. The proposed algorithm can extremely reduce the storage requirement and time consumption. The simulation results verify their validity.展开更多
文摘This paper introduces the definition of the Orthogonal Type Node Configuration and discusses the corresponding multivariate Lagrange, Hermite and Birkhoff interpolation problems in high dimensional space R s(s>2). This node configuration can be considered to be a kind of extension of the Cross Type Node Configuration , in R 2 to high dimensional spaces. And the Mixed Type Node Configuration in R s(s>2) is also discussed in this paper in an example.
基金supported by the National Key Research and Development Program of China (No.2016YFB0200701)the National Natural Science Foundation of China (Nos. 11532016 and 91530325)
文摘An efficient MPI/OpenMP hybrid parallel Radial Basis Function (RBF) strategy for both continuous and discontinuous large-scale mesh deformation is proposed to reduce the computational cost and memory consumption.Unlike the conventional parallel methods in which all processors use the same surface displacement and implement the same operation,the present method employs different surface points sets and influence radius for each volume point movement,accompanied with efficient geometry searching strategy.The deformed surface points,also called Control Points (CPs),are stored in each processor.The displacement of spatial points is interpolated by using only 20-50 nearest control points,and the local influence radius is set to 5-20 times the maximum displacement of control points.To shorten the searching time for the nearest control point clouds,an Alternating Digital Tree (ADT) algorithm for 3D complex geometry is designed based on an iterative bisection technique.Besides,an MPI/OpenMP hybrid parallel approach is developed to reduce the memory cost in each High-Performance Computing (HPC) node for large-scale applications.Three 3D cases,including the ONERA-M6 wing and a commercial transport airplane standard model with up to 2.5 billion hybrid elements,are used to test the present mesh deformation method.The robustness and high parallel efficiency are demonstrated by a wing deflection case with a maximum bending angle of 450 and more than 80% parallel efficiency with 1024 MPI processors.In addition,the availability for both continuous and discontinuous surface deformation is verified by interpolating the projecting displacement with opposite directions surface points to the spatial points.
基金This research was funded by the Key Research and Development Program of Shandong Province(No.2019GH Z023)the National Natural Science Foundation of China(Nos.41906155,42030406)+1 种基金the Fundamental Research Funds for the Central Universities(No.201762005)the National Key Scientific Instrument and Equipment Development Projects of National Natural Science Foundation of China(No.41527901).
文摘The sea surface height data volume of the future wide-swath two-dimensional(2D)altimetric satellite is thousands of times greater than that of nadir altimetric satellites.The time complexity of the 2D altimetry mapping reaches O(n^(3)).It is challenging to map the global grid products of future 2D altimetric satellites.In this study,to improve the efficiency of global data mapping,a new algorithm called parallel-dynamic interpolation(PA-DI)was designed.Through the use of 2D data segmentation and fine-grained data mosaic methods,the parallel along-track DI processes were accelerated,and a fast and efficient spatial-temporal high-resolution and low-error enhanced mapping method was obtained.As determined from a comparison of the single-threaded DI with the PA-DI,the new algorithm optimized the time complexity from O(n^(3))to O(n^(3)/KL),which improved the mapping efficiency and achieved the expected results.According to the test results of the observing system simulation experiments,the PA-DI algorithm may provide an efficient and reliable method for future wide-swath 2D altimetric satellite mapping.
文摘Aiming at the problem of low accuracy of interpolation error calculation of existing NURBS curves, an approximate method for the distance between a point and a NURBS interpolation curve is proposed while satisfying the accuracy of the solution. Firstly, the minimum parameter interval of the node vector corresponding to the data point under test in the original data point sequence is determined, and the parameter interval is subdivided according to the corresponding step size, and the corresponding parameter value is obtained. Secondly, the distance from the measured point to the NURBS curve is calculated, and the nearest distance is found out. The node interval is subdivided again on one side of the nearest distance. Finally, the distance between the data point to be measured and each subdivision point is calculated again, and the minimum distance is taken as the interpolation error between the point and the NURBS curve. The simulation results of actual tool position data show that this method can more accurately obtain the error of spatial NURBS interpolation curve.
文摘This paper advances a three-dimensional space interpolation method of grey / depth image sequence, which breaks free from the limit of original practical photographing route. Pictures can cruise at will in space. By using space sparse sampling, great memorial capacity can be saved and reproduced scenes can be controlled. To solve time consuming and complex computations in three-dimensional interpolation algorithm, we have studied a fast and practical algorithm of scattered space lattice and that of 'Warp' algorithm with proper depth. By several simple aspects of three dimensional space interpolation, we succeed in developing some simple and practical algorithms. Some results of simulated experiments with computers have shown that the new method is absolutely feasible.
基金the support from the UK Engineering and Physical Sciences Research Council (EPSRC) under the program (No. EP/K018345/1)the International Cooperation Program of China (No. 2015DFA70630)
文摘Driven by the ever increasing demand in function integration,more and more next generation high value-added products,such as head-up displays,solar concentrators and intra-ocular-lens,etc.,are designed to possess freeform(i.e.,non-rotational symmetric)surfaces.The toolpath,composed of high density of short linear and circular segments,is generally used in computer numerical control(CNC)systems to machine those products.However,the discontinuity between toolpath segments leads to high-frequency fluctuation of feedrate and acceleration,which will decrease the machining efficiency and product surface finish.Driven by the ever-increasing need for high-speed high-precision machining of those products,many novel toolpath interpolation and smoothing approaches have been proposed in both academia and industry,aiming to alleviate the issues caused by the conventional toolpath representation and interpolation methods.This paper provides a comprehensive review of the state-of-the-art toolpath interpolation and smoothing approaches with systematic classifications.The advantages and disadvantages of these approaches are discussed.Possible future research directions are also offered.
文摘The finite analytic method (FA) developed in the last decade is an effective numerical method for solving fluid flow problems. However, because of the limitation in the present computer, large round-off errors are found in calculating FA coefficients when Reynolds number is large. This paper investigates the cause of this difficulty and presents a special programming technique in making an accurate computation of FA coefficients. Then a fundamental function known as 'Pe' is tabulated by the accurate computation. In practical application the interpolation technique is employed so that the FA coefficients can be obtained reliably and quickly.
文摘In simulation,sometimes we wish to stipulate a specified angular velocity applied to a given frame.Although position,linear velocity and orientation interpolations are well studied,less attention is paid on angular velocity interpolation.In this paper,a new method to smoothly interpolate angular velocity using quaternions is presented.This method can be easily incorporated into a key frame animation system.The angular velocity at an arbitrary time can be calculated easily by our method.This method can also be generalized to smoothly interpolate orientations.
基金Supported by National Natural Science Foundation of China (No.61202261,No.61173102)NSFC Guangdong Joint Fund(No.U0935004)Opening Foundation of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education of China(No.93K172012K02)
文摘Meshed surfaces are ubiquitous in digital geometry processing and computer graphics. The set of attributes associated with each vertex such as the vertex locations, curvature, temperature, pressure or saliency, can be recognized as data living on mani- fold surfaces. So interpolation and approximation for these data are of general interest. This paper presents two approaches for mani- fold data interpolation and approximation through the properties of Laplace-Beltrami operator （Laplace operator defined on a mani- fold surface）. The first one is to use Laplace operator minimizing the membrane energy of a scalar function defined on a manifold. The second one is to use bi-Laplace operator minimizing the thin plate energy of a scalar function defined on a manifold. These two approaches can process data living on high genus meshed surfaces. The approach based on Laplace operator is more suitable for manifold data approximation and can be applied manifold data smoothing, while the one based on bi-Laplace operator is more suit- able for manifold data interpolation and can be applied image extremal envelope computation. All the application examples demon- strate that our procedures are robust and efficient.
基金supported by China 973 Frogram 2011CB302402the Knowledge Innovation Program of the Chinese Academy of Sciences(KJCX2-YW-S02)+1 种基金the National Natural Science Foundation of China(10771205)the West Light Foundation of the Chinese Academy of Sciences
文摘In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing, etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In order to improve the situation, exact interpolating methods are often proposed for the exact results and approximate interpolating methods for the ap- proximate ones. In this paper, the authors study how to obtain exact interpolation polynomial with rational coefficients by approximate interpolating methods.
基金This work was supported by the National Natural Science Foundation of China (Grant No. 60173052)Shandong Province Key Natural Science Foundation (Grant No. Z2001G01).
文摘This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precision and the shape of the interpolation surface. An approach to determining the freedom degrees is given, the continuity equations for constructing C2 quartic spline curve are discussed, and a new method for constructing C2 quartic spline surface is presented. The advantages of the new method are that the equations that the surface has to satisfy are strictly row diagonally dominant, and the discontinuous points of the surface are at the given data points. The constructed surface has the precision of quartic polynomial. The comparison of the interpolation precision of the new method with cubic and quartic spline methods is included.
文摘The regularized image interpolation method is widely used based on the vector interpolation model in which down-sampling matrix has very large dimension and needs large storage consumption and higher computation complexity. In this paper, a fast algorithm for image interpolation based on the tensor product of matrices is presented, which transforms the vector interpolation model to matrix form. The proposed algorithm can extremely reduce the storage requirement and time consumption. The simulation results verify their validity.
