基于三坐标测量机的曲面零件逆向设计研究

逆向工程也称反求工程,是对现有三维实物(样品或模型),利用三维数字化测量设备准确、快速测得轮廓的几何数据,并加以建构、编辑、修改生成通用输出格式的曲面数字化模型,从而生成三维CAD实体数模、数控加工程序或快速原型制造所需的模型截面轮廓数据。介绍了逆向设计,以波轮零件为例,分析了曲面零件特征,说明了应用三维CAD软件建立零件模型过程和方法,论述了基于三坐标测量机的曲面零件的逆向设计和验证过程。     

类螺旋特征测点数据的闭曲面建模方法研究

复杂曲面及海量点云测量数据的曲面建模已成为通用CAD/CAM软件的重要功能;然而,对于复杂的闭曲面建模方法,仍然存在许多技术上的难题,至今尚未能很好的解决,比如,基于海量的测量数据,如何进行闭曲面特征点识别,如何进行区域分割与处理,这一切都使得闭曲面建模过程中很难采用已经成熟的自由曲面建模技术和方法.通过研究异步仿形测量原理以及测量数据类型,针对鞋楦测量形成的空间螺旋线数据特征,提出一种闭曲面建模方法.该方法包括如下步骤:首先对测量点数据处理;并以特征螺旋线数据为基础对曲面进行三角分割;最后,以三角Bezier曲面为基础进行曲面构造,并将各曲面进行拼接、裁剪,形成完整的曲面.采用该方法对鞋楦测量数据的建模实例说明,能够有效地对具有空间螺旋线数据特征的闭曲面进行数据处理、曲面重构,提高了产品建模效率.     

复杂曲面造型原理及其工程应用

复杂曲面的逆向造型是曲面造型的核心。针对目前CAD／CAM系统存在复杂曲面造型方面的不足,开发了数据预处理程序,对测量得到的实体数据进行平滑滤波处理,消除由此带来的噪声影响,再利用预处理后的数据实现从型值点到控制点的反算以及B样条曲面的重构。结合Pro／E软件,较好的实现了复杂曲面的实体造型,从而为后续的数控加工打下了基础。     

反向工程中NURBS曲面CAD重构技术研究

CAD几何模型重构技术是反向工程RE(Reverse Engineering)技术的核心,NURBS(Non-Uniform Rational B-Splines)方法因其表示法的形状控制灵活性,在曲面造型和曲面重构中具有重要作用.针对CAD曲面重构技术进行研究,并对NURBS曲面重构提出一种新的构建方法,将每个数据点相对应的有理基函数的参数值最大化,所得函数值作为数据点的参数值来构造NURBS参数曲面.最后通过实例证明了该方法的有效性.     

基于曲率特征的自由曲面匹配算法

针对无任何预知联系下的自由曲面匹配问题,提出了一种简捷、快速的匹配方法.该方法以曲面的曲率为联系特征,在测量数据与模型曲面之间建立起满足角度、距离约束的对应关系,利用三点旋转平移变换法生成旋转平移变换列表;然后通过最小距离目标函数选取正确的三维坐标变换,实现测量数据与模型曲面之间的准确匹配.实验结果表明:该方法简捷、可靠且容易实现,特别适用于工件的测量定位和多视数据的融合.     

基于边界面法的完整实体应力分析理论与应用

提出基于边界面法（Boundary Face Method,BFM）的完整实体应力分析方法.在该分析中,避免对结构作几何上的简化,结构的所有局部细节都按实际形状尺寸作为三维实体处理.以边界积分方程为理论基础的BFM是完整实体应力分析的自然选择.在该方法中,边界积分和场变量插值都在实体边界曲面的参数空间里实现.高斯积分点的几何数据,如坐标、雅可比和外法向量都直接由曲面算得,而不是通过单元插值近似获得,从而避免几何误差.该方法的实现直接基于边界表征的CAD模型,可做到与CAD软件的无缝连接.线弹性问题的应用实例表明,该方法可以简单有效地模拟具有细小特征的复杂结构,并且计算结果的应力精度比边界元法（Boundary Element Method,BEM）和有限元法（Finite Element Method,FEM）高.     

CATIA V5环境下基于产品数模的三坐标测量机测点自动采样

为了实现CAD与CAIP(计算机辅助测量规划)的集成,提出了一种基于产品三维模型的CMM(三坐标测量机)测量点采样方法。该方法从产品的IGES文件中有效识别型面形状与边界定义,采用均匀采样与依曲率变化二次采样相结合的策略,针对各个型面类型制定专门的信息处理机制,实现测量点的自动采样,并通过转换在参数平面中判断采样点与裁剪区域的隶属关系,以有效剔除无效采样点;通过典型飞机部件外形曲面的采样点生成结果表明,该方法能有效应用于飞机的测量规划中。     

河道扫测测量空白数据填补处理

介绍了双三次B样条曲面法插值原理，顾及特征点影响对双三次B样条曲面型值点阵进行优化选取。将该算法引入填补扫测规则数据空白区域并与普通克里金法填补效果对比，尝试解决声纳扫测测量空白数据填补的问题。     

逆向工程中IGES数据接口的实现

逆向工程是当前先进制造技术研究的热点之一,通过对IGES标准及曲面实体数据的结构分析,进行逆向CAD软件的IGES接口设计,实现逆向软件与通用CAD造型软件之间曲面数据转换。     

边界保持的隐式曲面三角化方法

隐式曲面三角化是隐式曲面绘制的常用算法.对于开区域上散乱点数据重建的隐式曲面,常用的隐式曲面三角化方法得到网格模型不能很好地保持散乱点数据的边界.针对该问题,提出了一种边界保持的隐式曲面三角化方法.根据散乱点数据的空间分布,控制等值面的抽取范围,实现了边界保持.实验结果表明,该算法能够产生和散乱点数据边界一致的三角网格.     

Efficient CAD-based triangulation of unordered 3D data

Abstract. The paper proposes a new method for efficient triangulation of large, unordered sets of 3D points using a CAD model comprising NURBS entities. It is primarily aimed at engineering applications involving analysis and visualisation of measured data, such as inspection, where a model of the object in question is available. Registration of the data to the model is the necessary first step, enabling the triangulation to be efficiently performed in 2D, on the projections of the measured points onto the model entities. The derived connectivity is then applied to the original 3D data. Improvement of the generated 3D mesh is often necessary, involving mesh smoothing, constraint-based elimination of redundant triangles and merging of mesh patches. Examples involving random measurements on aerospace and automotive free-form components are presented. Received: 30 August 1999 / Accepted: 10 January 2000     

散乱数据点集的三角划分算法研究

在对当前的三角网格划分方法进行比较分析后,提出了一种散乱数据点集的3D三角网格划分算法,该算法不需如同二维划分方法一样要对散乱点集对应的自由曲面分片投影,并可自然处理含有凹边界及孔域的曲面数据点集,利用网格扩展、边界环分裂和边界环封闭,根据曲面的变化逐层推进生成三角网格,使算法能方便地处理非封闭曲面、空间剪裁曲面、封闭曲面、空间多连通曲面等各种曲面的散乱数据。     

CAD data visualization on mobile devices using sequential constrained Delaunay triangulation

3D graphic rendering in mobile application programs is becoming increasingly popular with rapid advances in mobile device technology. Current 3D graphic rendering engines for mobile devices do not provide triangulation capabilities for surfaces; therefore, mobile 3D graphic applications have been dealing only with pre-tessellated geometric data. Since triangulation is comparatively expensive in terms of computation, real-time tessellation cannot be easily implemented on mobile devices with limited resources. No research has yet been reported on real-time triangulation on mobile devices.In this paper, we propose a real-time triangulation algorithm for visualization on mobile devices based on sequential constrained Delaunay triangulation. We apply a compact data structure and a sequential triangulation process for visualization of CAD data on mobile devices. In order to achieve a high performance and compact implementation of the triangulation, the nature of the CAD data is fully considered in the computational process. This paper also presents a prototype implementation for a mobile 3D CAD viewer running on a handheld Personal Digital Assistant (PDA).     

Direct 5-axis tool-path generation from point cloud input using 3D biarc fitting

In reverse engineering, geometrical information of a product is obtained directly from a physical shape by a digitizing device. To fabricate the product, manufacturing information (usually tool-path) must be generated from a CAD model. The data digitized must be processed and in most cases, a surface model is constructed from them using some of the surface fitting technologies. However, these technologies are usually complicated and the process for constructing a surface patch from a massive digitizing data is time-consuming. To simplify the process for getting tool-path information, a simple algorithm is proposed in this paper. The algorithm is used to generate a 5-axis machining tool-path. Instead of implementing any complicated surface fitting techniques, a direct method is proposed for constructing three-dimensional (3D) triangular mesh from the digitizing data with the mesh points considered as the tool contact locations. Depending on the locations of the points digitized, a decimation procedure is applied such that some of the digitizing data will be filtered out. Then, the tool axis orientations which must be determined in 5-axis tool-path are calculated and the tool center locations are determined accordingly. A 3D biarc fitting technique is applied for all the tool center locations so that a complete 5-axis tool-path is obtained.     

一种基于三维Delaunay三角化的曲面重建算法

提出一种基于三维Delaunay三角化的区域增长式曲面重建方法。该方法以空间点云的Delaunay三角化为基础,结合局部区域增长的曲面构造,较以往方法具有人为参与更少、适用范围更广的优点。算法采用增量式插入点的方式构建空间Delaunay划分,采用广度优先算法,以外接圆最小为准则从Delaunay三角化得到的四面体中抽取出合适的三角片构成曲面。该算法的设计无须计算原始点集的法矢,且孔洞系数对重建的结果影响很小,重建出的三角网格面更符合原始曲面的几何特征。无论待建曲面是否是封闭曲面,本算法均可获得较好的重建效果。     

基于Delaunay四面体剖分的网格分割算法

为了构建有意义曲面分片,提出一种基于Delaunay四面体剖分的网格分割算法.首先根据Delaunay四面体剖分得到多边形网格内部的四面体,求出每个面上反映网格内部信息的Delaunay体距离;然后对Delaunay体距离进行平滑处理,再对网格上面的Delaunay体距离进行聚类,用高斯混合模型对Delaunay体距离作柱状图的拟合,利用期望最大化算法来快速求得拟合结果;最后结合图切分技术,同时考虑聚类的结果、分割区域的边界平滑和视觉认知中的最小规则,得到最终的网格分割结果.实验结果表明,采用文中算法可以有效地实现有意义的网格分割.     

Feature suppression based CAD mesh model simplification

Dynamic simulation and high quality FEA mesh generation need the CAD mesh model to be simplified, that is, suppressing the detailed features on the mesh without any changes to the rest. However, the traditional mesh simplification methods for graphical models can not satisfy the requirements of CAD mesh simplification. In this paper, we develop a feature suppression based CAD mesh model simplification framework. First, the CAD mesh model is segmented by an improved watershed segmentation algorithm, constructing the region-level representation required by feature recognition. Second, the form features needing to be suppressed are extracted using a feature recognition method with user defined feature facility based on the region-level representation, establishing the feature-level representation. Third, every recognized feature is suppressed using the most suitable one of the three methods, i.e. planar Delaunay triangulation, Poisson equation based method, and the method for blend features, thus simplifying the CAD mesh model. Our method provides an effective way to make CAD mesh model simplification meet the requirements of engineering applications. Several experimental results are presented to show the superiority and effectivity of our approach.     

基于三角剖分的人脸纹理映射

采用通用的三维人脸模型和任意的人脸纹理图像,基于Delaunay三角剖分,提出了一种灵活的3D人脸的纹理映射方法。该方法对人脸特征点集做三角剖分,在纹理图像和三维网格之间建立了一个准确的拓扑同构映射关系,从而得到高真实度的纹理映射。该算法不受网格调整精度的影响,同时适用于不同的纹理映射到同一三维人脸模型上。     

Isotropic Surface Remeshing Using Constrained Centroidal Delaunay Mesh

We develop a novel isotropic remeshing method based on constrained centroidal Delaunay mesh (CCDM), a generalization of centroidal patch triangulation from 2D to mesh surface. Our method starts with resampling an input mesh with a vertex distribution according to a user‐defined density function. The initial remeshing result is then progressively optimized by alternatively recovering the Delaunay mesh and moving each vertex to the centroid of its 1‐ring neighborhood. The key to making such simple iterations work is an efficient optimization framework that combines both local and global optimization methods. Our method is parameterization‐free, thus avoiding the metric distortion introduced by parameterization, and generating more well‐shaped triangles. Our method guarantees that the topology of surface is preserved without requiring geodesic information. We conduct various experiments to demonstrate the simplicity, efficacy, and robustness of the presented method.     

A highly solid model boundary preserving method for large-scale parallel 3D Delaunay meshing on parallel computers

In this paper, we propose a novel parallel 3D Delaunay triangulation algorithm for large-scale simulations on parallel computers. Our method keeps the 3D boundary representation model information during the whole parallel 3D Delaunay triangulation process running on parallel computers so that the solid model information can be accessed dynamically and the meshing results can be very approaching to the model boundary with the increase of meshing scale. The model is coarsely meshed at first and distributed on CPUs with consistent partitioned shared interfaces and partitioned model boundary meshes across processors. The domain partition aims at minimizing the edge-cuts across different processors for minimum communication cost and distributing roughly equal number of mesh vertices for load balance. Then a parallel multi-scale surface mesh refinement phase is iteratively performed to meet the mesh density criteria followed by a parallel surface mesh optimization phase moving vertices to the model boundary so as to fit model geometry feature dynamically. A dynamic load balancing algorithm is performed to change the partition interfaces if necessary. A 3D local non-Delaunay mesh repair algorithm is finally done on the shared interfaces across processors and model boundaries. The experimental results demonstrate our method can achieve high parallel performance and perfect scalability, at the same time preserve model boundary feature and generate high quality 3D Delaunay mesh as well.