T-spline based unifying registration procedure for free-form surface workpieces in intelligent CMM

With the development of the modern manufacturing industry, the free-form surface is widely used in various fields, and the automatic detection of a free-form surface is an important function of future intelligent three-coordinate measuring machines (CMMs). To improve the intelligence of CMMs, a new visual system is designed based on the characteristics of CMMs. A unified model of the free-form surface is proposed based on T-splines. A discretization method of the T-spline surface formula model is proposed. Under this discretization, the position and orientation of the workpiece would be recognized by point cloud registration. A high accuracy evaluation method is proposed between the measured point cloud and the T-spline surface formula. The experimental results demonstrate that the proposed method has the potential to realize the automatic detection of different free-form surfaces and improve the intelligence of CMMs

Interactive modelling and simulation using blending techniques

Blending splines are constructions where local geometry is blended together by a blending function to create global geometry. The different basis functions has different properties, which can be suited for different problems. Different basis functions, properties and the implementation of physical properties with a focus towards utilizing parts of blending splines in an isogeometric analysis (IGA) context constitutes the basis for the current study. This paper gives an introduction to a newly started PhD project regarding the use of blending splines in modeling and simulation environments

Analysis-suitable adaptive T-mesh refinement with linear complexity

We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of their cardinalities, nestedness of the generated T-spline spaces, and linear computational complexity of the refinement procedure in terms of the number of marked and generated mesh elements.Comment: We now account for T-splines of arbitrary polynomial degree. We replaced the proof of Dual-Compatibility by a proof of Analysis-suitability, added a section where we address nestedness of the corresponding T-spline spaces, and removed the section on finite overlap the spline supports. 24 pages, 9 Figure