STL File Generation with Data Reduction by the Delaunay Triangulation Method in Reverse Engineering

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and typical steps include the scanning of a clay or wood model and the generation of manufacturing data such as an STL file. A new approach to remove point data with Delaunay triangulation is introduced to deal with the size problems of the STL file and the difficulties in the operation of the rapid prototyping (RP) process. The selection of a group of triangles, based on the angle, is used for a robust and reliable implementation of the Delaunay triangulation method. The developed software enables the user to specify the criteria for the selection of the group of triangles by the angle between triangles, the percentage of reduced triangles, and the allowable area. This approach can be used to reduce the measuring data from the laser scanner, thus save the handling time of point data during the modelling process and is useful for verifying and slicing the STL model during the RP process.     

基于区域Voronoi图的复杂形体的三维重建算法

针对目前由二维轮廓线重建三维实体的方法要求轮廓线间距小、形状相似,对轮廓分叉及孔洞的解决有诸多限制且计算量大费时等问题,提出了Delaunay三角剖分与体素重建的思想相融合的方法。首先将断层图像轮廓近似表示成平面多边形,并利用Voronoi图进行划分,然后对其进行三角剖分。最后通过最短路径把这些三角形连接到相邻断层轮廓线的顶点上,扩展成四面体,从而直接完成三维重建。试验结果表明,该方法能较好地解决轮廓的分叉、孔洞等问题,且减少了数据量。     

基于三角剖分的曲面变形

介绍一种三维空间中基于散乱数据点三角剖分的自由变形技术。运用Voronoi图和Delaunay三角剖分,将待变形曲面上的点(作用点)用控制顶点线性表示出来,移动控制顶点使作用点发生位移,从而使曲面的形状发生局部的改变。这种方法改进了诸如自由变形(FFD)、直接自由变形(DFFD)和扩展自由变形(EFFD)等传统曲面变形技术在局部变形上的应用。     

基于二维Delaunay近邻的空间散乱数据曲面重建算法

给出了一种新的散乱数据曲面重建算法。算法基于曲面的局平特性，通过二维Delaunay三角剖分到三维空间的映射，快速查找空间任意点的Delaunay近邻，然后根据散乱数据重建三角网格中顶点互为Delaunay近邻的原理，进行曲面拓扑重建。应用新的求解κ-近邻和二维Delaunay近邻的算法，提高了曲面重建的算法效率。实验表明，该算法高效、稳定，对不均匀数据有较好的适用性。     

基于三坐标测量机的螺旋曲面重建

介绍了一种螺旋曲面的重建方法,详细阐述了设计流程。由三坐标测量机获取螺旋曲面数据,实现了测量数据中噪声点的剔除,利用Delaunay三角化重建了曲面。通过滚刀实例的初步验证,说明方法正确可行。     

基于维诺图匹配的粒子跟踪测速法

针对密集颗粒流速度场分布的测量问题,提出了基于维诺图匹配的粒子跟踪测速法。首先,通过对图像粒子进行维诺图构建,给出面积相似度筛选匹配粒子的条件;其次,引入Delaunay三角网搜索结构,通过计算维诺多边形的形状相似度来匹配粒子;再次,研究了去除错误匹配粒子矢量的方法和匹配算法中的关键参数;最后,通过模拟二维旋转流场运动以及二维转盘中的颗粒流实验对算法进行了测试。结果表明:维诺图匹配的匹配准确率高于DT-PTV并且在处理密集粒子匹配效果上更好;维诺图匹配算法适用于测量密集颗粒流速度场分布,颗粒匹配准确率高达99%,并由得到的颗粒流速度场分布验证了算法的有效性。     

Generating Tool Paths for Free-Form Pocket Machining Using z-Buffer-Based Voronoi Diagrams

Voronoi diagrams for closed shapes have many practical applications, ranging from numerical control machining to mesh generation. Curve offsetting based on Voronoi diagrams avoids the topological problems encountered in traditional offsetting algorithms. In this paper, we present a new procedure for generating tool paths using z-buffer-based Voronoi diagrams specially to deal with free-form shaped pockets. Using a z-buffer, a proposed algorithm effectively extracts the topological information on the Voronoi diagram, and generates the geometric information on the Voronoi edges approximately. These Voronoi edges are refined using a numerical algorithm. This method is independent of curve type and is applicable to any pockets with parametric curve boundaries that are twice differentiable.     

一种基于Delaunay三角剖分的特征点坐标对应方法

研究了平面网格点集的Delaunay三角剖分性质,提出ACDT方法,并在IC封装环境下实现了圆点阵列靶标特征点的自动对应。实验结果表明,当图像存在拍摄倾角或由靶标平移、旋转引起的特征点缺失时,该方法仍可有效运行,且对镜头畸变引起的图像非线性变形不敏感,特别适合IC封装视觉定位系统的在线标定。     

离散数据点集的3D三角划分算法研究

在实物测量造型过程中,根据离散点集进行三角网格划分是其关键环节之一,也是进行后续进行曲面重构的前提和基础。本文在当前的三角网格划分方法比较之后,提出了一种散乱点集的三角网生长算法,该算法无须对离散点集所对应的自由曲面进行分片投影,直接在3D空间从已划分区域边界到未划分区域按照Delaunay准则生成三角网格,并给出了用此算法处理散乱数据的试验结果。     

Tool path generation for machining free-form pockets using Voronoi diagrams

Voronoi diagrams for closed shapes have many practical applications, ranging from numerical control machining to mesh generation. Curve offsetting based on Voronoi diagrams avoids the topological problems encountered in the traditional offsetting algorithms. In this paper, we propose a procedure using Voronoi diagram-based tool-path generation for machining pockets with free-form boundaries. A pocket can be bounded by 2D free-form curve elements that are differentiable twice. The procedure consists of three steps:

Assessing Roundness Errors Using Discrete Voronoi Diagrams

In this paper, we propose anew procedure for measuring roundness errors by computong apaor of concentric corcles with the minimum tsdial separation for assessing the srrors by constructing the discrete farthest and nearest Voronoi diagrams. The peoperties of Voronoi diagrams are exploited to determine a pair of concentric circles with minimum radical separation such that all the data points are bounded by these two circles. A pixel map is used to construct a discrete Voronou diagram. The convergence of the proposed procedure to the true global minimum roundness error is guaranteed. This procedure based on discrete Voronoi diagrams is robust even for a large number of data points. The proposed procedure is simple in implementation and effective in computation.     

基于二面角平分插值的车身外形三维重建

为了缩短车身设计的周期,利用插值的三维重建方法被广泛地应用在车身造型设计。目前常用的插值方法存在细节特征表现不足,平滑但不过原始控制点等问题,提出了在利用Delaunay三角剖分生成的初始三角网格上进行二面角平分插值的方法,该方法通过二面角平分插值不断逼近原始曲面,插值出来的网格通过原始控制点集,符合车身外形的三维造型设计。实验结果表明:该方法不仅稳定性高,而且能保留曲面的细节特征,可适用于三维曲面重建的各种领域。     

基于单目摄像机的光学立体标定技术

为了构建一种基于单摄像机的三维视觉系统,提出了重构光学标定点三维坐标、计算重构误差和优化标定参数的方法。通过移动高精度位移平台,构建三维视觉系统,计算左右摄像机位的初始参数,引入质心坐标法计算两摄像机位间的旋转平移矩阵,利用最优三角剖分法重构光学标定点的三维坐标,计算并最小化重构误差,对标定参数进行优化。实验表明：重构误差直接反映了三维重建的效率,该方法的精度和鲁棒性得到了显著的提高;实物外形测量的误差从0.1123 mm减小到0.0191 mm,标准差从0.1838减小到0.1275。该方法适合应用于三维视觉系统标定质量的评估。     

A Memetic Algorithm for the <Emphasis Type="SmallCaps">n</Emphasis>/2/Flowshop/α<Emphasis Type="SmallCaps">F </Emphasis>+ β<Emphasis Type="SmallCaps">C</Emphasis><Subscript>max</Subscript> Scheduling Problem

Machine scheduling has been a popular area of research during the past four decades. Its object is to determine the sequence for processing jobs on a given set of machines. The need for scheduling arises from the limited resources available to the decision-maker. In this study, a special situation involving a computationally difficult n/2/Flowshop/ αF + βCmax flowshop scheduling problem is discussed. We develop a memetic algorithm (MA, a hybrid genetic algorithm) by combining a genetic algorithm and the greedy heuristic using the pairwise exchange method and the insert method, to solve the n/2/Flowshop/ αF + βCmax flowshop scheduling problem. Preliminary computational experiments demonstrate the efficiency and performance of the proposed memetic algorithm. Our results compare favourably with the best-known branch-and-bound algorithm, the traditional genetic algorithm and the best-known heuristic algorithm.     

支持概念设计的表面蒙面算法

提出一种针对任意多边形边界内嵌任意形状、任意多个内特征的“递归式”三维平面三角划分方法 ,该算法主要应用于产品概念设计中零件的可视化处理。在提出“有效线段”概念及相关三维平面“内外点的判定”方法的基础上 ,提出针对不同内外特征形状的一整套三角划分方法。较之一般的三角剖分算法 ,本方法着重提高了算法的简单性、通用性及处理问题的有效性 ,本文的研究成果已成功应用于“86 3”课题 :基于广义映射原理的绿色产品设计自动化软件系统中     

参数化模型到直接建模的模型转换方法

参数化建模和直接建模方法是当前主流的两种三维几何建模方法,两者在功能上有较强的互补性。为了实现两种模型之间的转换,更好地体现设计者的设计意图,提高设计效率,提出了基于曲面重构的转换方法。通过对参数化模型表面点集做Delaunay三角剖分,求解出模型表面几何方程,拟合重构出直接建模模型,并以包含特征信息的三角网格单元的跟踪标记和数据更新来实现直接建模操作。实验表明,该转换方法适用于大多数特征模型的转换,且具有较高的转换效率。     

A robust approach to edge detection of scanned point data

In reverse engineering, segmentation is used to divide a point data set into subsequent regions according to its shape. It is vital for interpretation of discrete scanned data since surface reconstruction can be accomplished one-by-one on a given region. Edge detection is crucial to the segmentation process. The level of edge detection depends on the complexity of the part, and it determines the eventual success or failure of the reverse engineering (RE) process. This paper proposes a novel approach to the edge detection of 3D points based on a region growing technique. The proposed algorithm consists of two parts. First, polygonal meshes are generated to the scanned point data using the Delaunay triangulation algorithm. Second, the normal vector and the area of a polygonal mesh are checked to find boundary meshes using cost criteria (angle criterion and area criterion) based upon a region growing technique. The region growing technique aggregates meshes into a region until the area of aggregated meshes reaches an area threshold from a series of seed meshes. The proposed edge detection method is found to be effective when compared with other methods.     

光滑质点流体动力学方法中数值断裂的防止

为解决光滑质点流体动力学方法数值模拟过程中出现的数值断裂问题,提出一种基于Delaunay三角剖分及其对偶形式最近点意义下的Voronoi图的粒子产生和消除技术,对产生数值断裂的区域重新布点。同时讨论此技术实施过程中伴随的质量、动量和能量守恒问题的解决办法。通过典型数值算例的模拟分析可以看出,粒子产生和消除技术可以有效地解决数值断裂问题。当考察程序的相对运行时间随模型粒子数目的变化时发现,只使用粒子产生技术时,由于粒子数目大量增加使程序运行时间急剧增加。而同时使用粒子产生和消除技术时,由于粒子数目基本不变,使程序运行时间只增加百分之十左右。当考察在整个程序的运行过程中模型总能量的变化时发现,使用文中提出的守恒问题解决办法,可以基本保证能量始终守恒。     

基于Matlab三维数据点三角剖分方法研究

逆向工程中点云数据点三角划分处理,在散乱数据插值曲面构造、快速原型制造以及有限元分析等方面有着重要的应用.根据Delaunay三角划分理论及Lawson优化准则,借助于Matlab中用于点云处理模块快速实现了空间散乱数据点的直接三角划分,给出了数据点三角划分程序代码,并以某小客车车身外表面点云数据处理过程加以验证,给出其外形数据点Delaunay三角划分以及凸壳包络图,由此可以早期发现逆向设计过程中可能存在的问题,从而减少后期修改次数,极大缩短新产品的开发周期,提高了设计精度.     

Influence of Punch Radius and Angle on the Outward Curling Process of Tubes

Using the theory of updated Lagrangian formulation, this study adopted the elasto-plastic finite-element method and extended the increment determination method, the r_min method, to include the element’s yielding, nodal contact with or separation from the tool, maximum strain and limit of rotation increment. The computer code for a finite-element method is established using the modified Coulomb’s friction law. Conical punches with different radii and angles are used in the forming simulation of hard copper and brass tube ends. The effects of various elements including the half-apex angle of punch (α) and its radius (R), the ratio of the thickness of the tube wall to the mean diameter of tube, mechanical properties, and lubrication on the tube’s outward curling, are investigated. Simulation findings indicate that when the bending radius at the punch inlet (ρ) satisfies the condition of ρ≤ρ _c , curling is present at the tube end. On the other hand, if ρ≥ρ _c , the tube end experiences flaring. The variable ρ _c is called the critical bending radius. The value of ρ _c increases as the value of α increases. Furthermore, the findings also show that ρ _c is neither correlated with tube material nor lubrication.