基于改进MC算法的DICOM格式CT图像三维重建

保证MC算法所抽取等值面的拓扑正确并作有效实现是医学三维应用的关键技术。本文对MC算法的内部拓扑歧义判定方法作了改进,使其更为简单直观,并以此为基础开发了CT序列图像三维重建系统。系统读入D ICOM格式的CT图像数据,封装成由立方体单元组成的规则体数据,用改进的MC算法抽取等值面,得到三角网格模型,为后续基于三角网格的医用修复体设计研究打好了基础。     

The development of a technique for 3D complex surface reconstruction from unorganized point cloud

In this paper, we propose a new neural network based on our two-level adaptive hierarchical clustering algorithm. The algorithm is to manage unorganized points, so that the triangular mesh models can be correctly obtained by applying the triangular mesh creation algorithm. We also develop adaptive self-flipping triangle edges to improve triangular mesh structure. Only one parameter, the maximal edge length of triangle, is needed in the neural network. The proposed two-level consists of the first level for clustering the cloud of points that has same order of the maximal edge length into a same cluster and the second level for generating triangular surface model or drape surfaces over the points of the same cluster. The normal vector for the generated triangular 3D surface model can be obtained from the second level. This helps to generate the STL file or stereolithography format. From the experimental results it can be shown that the proposed method is very effective for clustering unorganized point clouds for generating a triangular mesh of complex surfaces.     

Interference-free cutting-path generation based on scanning data

This work presents a novel cutting-path planning strategy for three-axis machining of 3D scanning data. A curve-fitting algorithm is employed to fit each array of the measured data into parallel sectional curves, ensuring that the effect of measurement and form errors can be substantially reduced. The best-fitting sectional curves are then used to construct a surface of triangular meshes. A modified chord-length method is also proposed to adequately control the accuracy of the triangular meshes generated. The triangular meshes are then offset along the surface normal to obtain an offset mesh surface on which the cutting paths are planned. An effective gouging detection and removal algorithm are also proposed to prevent the machined surface from overcutting. Several computer simulation results demonstrate the feasibility of the proposed strategy.     

基于网格特征临界点的三维工程模型检索算法

为有效检索并重用现有三维模型及相关设计知识,针对工程三角网格模型,提出了一种与计算机辅助设计系统无关的基于网格特征临界点的三维工程模型检索算法.根据Morse理论,采用网格顶点处的离散平均曲率作为光滑实值函数,计算网格特征临界点;采用两临界点间近似测地距离和顶点法矢夹角余弦值作为联合形状函数,按照极大值点、极小值点和鞍点,分别计算同类临界点间的联合形状函数得到形状分布,从而将模型的比较映射为形状分布矩阵的比较.在普渡大学建立的工程标准模型库上对算法进行了验证和比较.实验结果表明,本算法客观反映了工程模型的相似程度.明显提高了基于图形分布检索算法的有效性.     

Complete 3D surface reconstruction from unstructured point cloud

In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.     

体素模型表面优化提取方法及图形显示

三维体数据的显示方法有2种直接体绘制方法和间接体绘制方法。本文首先比较了这2种体数据显示方法的优缺点,然后介绍了基于渐进立方体(MarchingCubes)方法的间接体绘制方法。根据压缩形式的体素模型特点,提出了一种新的体素模型表面三角网格提取优化算法,该算法利用材料变化信息直接在位于物体表面的体素模型中提取表面三角网格,与传统的MarchingCubes算法相比,该算法不仅可以跨越物体外部全空的体素,还可以跨越位于物体内部全实的体素。该方法在基于Voxel模型的五坐标数控加工仿真系统中得到了应用,测试结果表明,采用该方法提取体素模型表面三角网格时可以提高效率2~3倍。     

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

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

分布式同步协同设计中基于三角网格模型的实时传输

在充分对比CAD模型和三角网格模型特性的基础上，针对分布式同步协同设计的实时性要求和网络环境，提出基于三角网格模型进行分布式同步协同设计，建立了系统框架。该系统以三角网格模型作为产品的3D表达形式，通过构建有效的多分辨率模型与增量传输机制，在客户机/服务器环境下，实现客户端驱动的产品3D模型的远程实时动态观察和特征参数的在线讨论与修改。该系统可跨平台支持多个异地设计端点的协同。     

OpenGL在SMT焊点中的应用

为检测SMT焊点的质量,提取焊点质量信息,研究了利用光学手段实测的SMT焊点的三维重建和显示技术,并且运用Visual C#．Net和OpenGL编制了一套软件。该软件可以利用SMT焊点的二维图像,通过三维重构算法计算出SMT焊点的表面高度离散点的数据集,即离散点云。对离散点云进行排序重组和三角网格化后,运用OpenGL对三角网格进行消隐,设定法线、光照、材质和贴图的处理,重建SMT焊点的表面,由此获得SMT焊点的三维信息,利于分析焊点的质量信息。     

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

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

Monte Carlo simulation of secondary electron images for real sample structures in scanning electron microscopy

Monte Carlo simulation methods for the study of electron beam interaction with solids have been mostly concerned with specimens of simple geometry. In this article, we propose a simulation algorithm for treating arbitrary complex structures in a real sample. The method is based on a finite element triangular mesh modeling of sample geometry and a space subdivision for accelerating simulation. Simulation of secondary electron image in scanning electron microscopy has been performed for gold particles on a carbon substrate. Comparison of the simulation result with an experiment image confirms that this method is effective to model complex morphology of a real sample.     

高效率的三角网格模型保特征简化方法

部分三角网格模型因数据量庞大而导致其不便于存储、分析和显示,本文提出了一种结合网格精细化方法的三角形折叠网格简化算法以解决此问题。首先通过3~(1/2)网格细分法确定待折叠三角形三个顶点的修正坐标,并根据修正坐标初步确定折叠点位置,然后引入折叠点的拉普拉斯坐标和原三角形法向信息来更新折叠点位置,最后由三角形折叠后该区域的体积误差和被折叠三角形的平展度共同确定折叠代价,从而使网格优先从较为平坦和特征点较少的区域开始依次进行三角形折叠简化。对多个模型进行了实验测试和数据分析,结果表明该方法能够有效精简网格数据,与3个不同类型的简化方法相比,该方法的简化效率最高,而且能有效保持原网格模型的几何特征并控制简化三角形的质量。     

Local Mesh Decimation for View-Independent Three-Axis NC Milling Simulation

The view dependency of typical z-buffer-based NC simulation methods is overcome by a polygon rendering technique that generates polygons to represent the workpiece, thus enabling dynamic viewing transformations without reconstruction of the entire data structure. However, the polygon rendering technique still has difficulty in realising real-time simulation owing to the limited performance of current graphics devices. There-fore, it is necessary to develop a mesh decimation method that enables rapid rendering without loss of display quality. To meet this requirement, in this paper, a new mesh decimation algorithm is proposed for a workpiece which is represented by the z-map structure and whose shape is dynamically changed by the tool. In this algorithm, the z-map data for the workpiece are divided into several regions, and a triangular mesh is constructed for each region. Then, if the tool cuts any region, its mesh is regenerated and decimated again. Since the range of mesh decimation is confined to a few regions, the reduced triangles for rapid rendering can be obtained in a short time. This local mesh decimation method may contribute toward realising the polygon rendering-based NC simulation in real-time on computers equipped with general graphics cards.     

Improvement of cutting simulation using the octree method

This paper develops an octree-based algorithm for machining simulation. Most commercial machining simulators are based on the Z-map model, which has several limitations in terms of achieving a high level of precision in five-axis machining simulation. Octree representation being a three-dimensional (3D) decomposition method, an octree-based algorithm is expected to be able to overcome such limitations. With the octree model, the storage requirement is reduced. Moreover, recursive subdivision is processed in the boundaries, which reduces useless computations. The supersampling method is the most common form of antialiasing and is typically used with polygon mesh rendering in computer graphics. The supersampling technique is being used to advance the efficiency of the octree algorithm.     

基于隐式曲面的三角网格模型等距算法

针对三角网格模型，提出了一种基于隐式曲面的等距算法。该算法首先对三角网格模型进行拓扑重建，然后对顶点进行八叉树采样，由采样点及采样点的单位法矢点来构建隐式曲面，将隐式曲面等距，最后将原模型的顶点投影到等距曲面得到投影点，根据先前建立的拓扑关系，将投影点三角网格化得到等距后的三角网格模型。该算法在一定数值范围内避免了等距模型自交问题，而且等距模型三角网格均匀，质量高。     

An adaptive mesh model for 3D reconstruction from unorganized data points

Reconstructing exact topology mesh from data points is one of the most important tasks in the fields of industrial CAD/CAE/CAM, computational vision and reverse engineering. In this paper, a deflation algorithm that integrates an adaptive mesh and physical constraint model is presented for the 3D reconstruction of geometric-closed shape (genus 0) from unorganized data points. First, an initial mesh is formed using the Delaunay algorithm. Second, an asymptotic deforming performance is accomplished to deflate initial mesh towards the local concave boundary step-by-step. In this phase, a physical constraint model of coupled particle systems based on particle dynamics and Newtonian law of motion is constructed, and the model dynamically controls mesh deformation as a behavior constraint. To guarantee that the resultant mesh is homeomorphous to the original surface of data points, a continuously deforming mechanism, visibility cone and collision-detecting criterions are designed. At last, experimental results in reverse engineering which supports the usefulness of this method for reconstruction .     

基于网格模型的空腔建模算法

提出了一个基于网格模型的空腔建模算法,目的是实现骨髓腔的精确建模。算法基于先离散后重建的思想,从三维网格模型的离散点云数据中搜索空腔边界环,根据空腔边界环进行三角划分得到最终的三维空腔模型。改进了判断内、外边界环的关系的射线法,并提出基于分层的三维点集空间直接三角划分算法,最后以股骨骨髓腔和牙髓腔的建模为例,验证了该算法的有效性和稳定性。     

Triangular mesh generation employing a boundary expansion technique

This paper presents a triangulation method for modelling very large sets of cloud data. The three-dimensional (3D) data sets are produced by a machine vision system and/or coordinate measuring machine (CMM). The algorithm is suitable for processing the data collected from objects composed of free form surface patches especially with interior holes. This is accomplished from the 3D data sets in two steps. Firstly, the original cloud data is reduced into a simplified data set employing a data reduction technique (voxel binning method), in which the error between the cloud data and the meshed surface is used to control the data reduction. Secondly, the triangulation process starts with a randomly selected seed triangle. The triangular mesh extends outward by continuously linking suitable external points to it along the boundary edges of the meshed area. A complex free form surface with interior holes can be triangulated in one computing session without manually dividing it into several simple patches. The error-based data reduction parameters are extracted from the cloud data set, by a series of local surface patches, and the required spatial error between the final triangulation and the cloud data. Experimental results are given to illustrate the efficacy of the technique for rapidly constructing a geometric model from 3D digitised cloud data.     

基于四叉树法和波前法的曲面网格剖分算法

提出了一种基于四叉树法和波前法的有限元网格生成算法。该算法首先将裁剪曲线边界离散成多边形,然后使用四叉树法对待划分裁剪参数曲面按细分要求进行递归分解,最终生成规则的栅格点,最后利用波前法的原理生成三角形网格,通过合并处理生成三角形与四边形混合网格。     

大型油罐容量计量中3D空间建模方法研究与比对试验分析

油罐的容量计量是石化企业生产运行的核心工作之一.为了提高计量检定效率,提出一种基于三维激光扫描原理的油罐容量全自动测量方法.讨论了一种扫描点云数据分析方法,通过三角网格和曲面拟和的方法计算出不同液位高度对应的油罐容积值.设计了对比试验系统,选取60 m~3和37 m~3两个标准油罐为研究对象,根据OIML R71和R80的技术要求,以0.025%准确度的容量比较法测量值为参考依据,三维激光扫描方法进行油罐容量测量具有好的复现性,而测得的容量值相对偏差满液位量程处可达0.4%,验证了这种方法的有效性,而且有效提高了油罐容量检定工作效率.