一种空间曲面上散乱数据的快速三角剖分新算法

在现有三角剖分方法研究的基础上,提出了一种空间曲面上点云数据的快速三角剖分新算法。以区域生长法为主导,通过表面法向量向外原则提出了一种种子三角形选取与构造的新方法,改进生长算法,采用逆时针方式搜寻最优扩展点来生成三角形网格。该算法的总体时间复杂度为O（KN）,能够快速高质量的生成三角网格模型。     

STEP到VRML格式转化中实体三角剖分的快速算法

针对 STEP到 VRML 文件格式转换的需求 ,提出了一种改进的平面多连通域到单连通域的快速切分方法 ,并介绍一种适合 VRML 应用的任意二维平面域快速三角剖分算法 ,该算法生成的三角形较少     

散乱数据点的快速三角剖分算法

提出了一种改进的波前扩展算法,该算法给出的候选点判断准则,可对数据点的K近邻进行快速过滤,并有效避免了单元自相交;建立的匹配点查找和优化准则,可生成局部优化的三角形网格单元;依据四种不同的查询结果,制定了相应的波前环更新和数据点标记方法。将波前扩展算法应用于具有复杂特征的散乱数据点的三角剖分中,结果表明,该算法可快速生成高质量的三角网格模型。     

散乱数据点的快速三角剖分算法

提出了一种改进的波前扩展算法,该算法给出的候选点判断准则,可对数据点的K近邻进行快速过滤,并有效避免了单元自相交;建立的匹配点查找和优化准则,可生成局部优化的三角形网格单元;依据四种不同的查询结果,制定了相应的波前环更新和数据点标记方法.将波前扩展算法应用于具有复杂特征的散乱数据点的三角剖分中,结果表明,该算法可快速生成高质量的三角网格模型.     

存在约束条件的复杂曲面三角网格剖分方法

针对存在特征约束条件的复杂曲面三角剖分提出了一种新的算法，该算法首先将该类复杂曲面划分成平面参数域，产生较为均匀的参数域，进而对各子平面参数域进行平面参数域的三角剖分，然后将所得到的各子平面参数域映射为空间Beizier网格结点，形成粗网格三角剖分后进行各子曲面片间G^1连续的拼接运算，最后动用曲率标准和细分规则进行三角剖分质量的优化。该方法不但可以较好处理复杂曲面，而且能克服曲面网格产生裂缝。     

基于三角剖分的雕刻学习曲面轨迹生成

结合雕刻学习的特点，给出了雕刻学习曲面三角剖分数据结构，说明了雕刻学习曲面轨迹生成应注意的问题，并给出了详细的算法说明，该方法能满足雕刻学习曲面雕刻加工的高效和自然等特点，适应了自由曲面几何特性和雕刻数据采集的特殊性，是一种切实可行的方法。     

三角剖分技术在消隐中的应用

三角剖分是有限元网格划分的重要工具之一。本文将这一方法应用于装配图的消隐之中，并介绍其原理及实现步骤。     

基于改进三角剖分算法与微惯导技术的三维模型构建方法

针对目前消防部队灭火救援作战中无CAD图样时建筑三维模型无法构建的问题,提出了基于微惯导技术与Unity3D建模技术,利用改进的三角剖分算法快速构建城市建筑三维模型的方法,并阐述了三维模型构建的详细过程。试验实例表明,通过该方法在无CAD图样时构建的三维建筑模型具有很好的可视化效果,并在灭火救援指挥作战中具有很强的实用性。     

一种散乱数据的三角剖分新算法

根据逆向工程中散乱数据点规模越来越大的趋势,为缩小剖分时搜寻和遍历数据点的空间范围,提高算法效率,提出了一种大规模散乱数据的空间划分方法及相应的数据结构和编码方案.同时,提出了外连剖分和内连剖分的概念,给出了基于局部增量网格扩张的3维散乱数据点的空间直接三角剖分算法.该算法的总体计算复杂度为O（N）,与三角剖分的典型算法相比,有效降低了其时间复杂度,提高了剖分后网格的质量.     

曲面拼接与扩展的三角剖分算法的改进

对递归分割曲面在编辑方面的拼接和平面扩展问题的散乱点的三角剖分算法进行了研究.通过边界轨迹优先生成和点的有效性判断等约束条件对原有剖分算法进行了改进,顺利实现了递归分割曲面的拼接和平面扩展,并保证了拼接边界和扩展边界网格拓扑的正确性.     

快速成型技术中分层算法的研究综述

作为快速成型技术中必不可少的环节,根据对零件制造精度和装配要求及效率的侧重不同,多年来多种分层算法已被国内外学者开发出来。在同等加工条件下,根据加工精度要求和层厚变化的不同,将分层算法大致分为等层厚分层算法和适应性分层算法两类。从常用的立体光刻(STL)模型、原始计算机辅助设计(CAD)模型和点云数据3种数据模型入手,简述了两类分层算法的研究和发展;介绍了采用斜边的分层算法、基于区域划分的混合算法、曲面分层算法等先进分层算法;讨论了分层算法中待解决的问题:直接分层算法的文件格式标准和轮廓的精确拟合等问题。最后,总结得出了分层算法未来的研究方向和趋势。     

Fast parallel algorithm for slicing STL based on pipeline

In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can’t make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl’s law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson’s law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.     

截面扫描型点云数据的三角剖分算法

截面扫描型点云数据三角剖分的难点在于在三角剖分中找到一个合适的数学模型来统一各条扫描线点个数。本文利用NURBS曲线的表达式作为数学模型,提出了基于曲线相容性的三角剖分方法。首先对截面轮廓数据进行排序,用NURBS曲线进行拟合,然后对截面曲线进行相容性操作,在离散的基础上实现了三角剖分算法。     

AutoCAD环境下直接适应性切片方法及实现

数据分层处理是快速成型技术的核心.适应性分层可以有效解决快速成型中成形精度和速度之间的矛盾.利用AutoCAD二次开发技术,通过比较相邻层片截面的面积确定切片厚度,提出了一种基于CAD模型的直接适应性切片方法,并对该方法进行了实现,同时与定层厚切片方法进行了比较,最后给出了分层实例并对结果进行了分析.     

快速成型技术中分层算法的研究与进展

根据对零件制造精度和效率的关注程度的不同,开发出了多种分层算法.在同等加工时间的情况下,根据加工精度的不同,将这些分层算法分为等层厚分层算法和适应性分层算法两类.通过对STL模型、原始CAD模型和点云数据的分析,讨论了两类分层算法的研究和发展,然后介绍了斜边分层算法和曲面分层算法等先进分层算法的原理和成果,最后讨论了快速成型分层算法的研究方向和趋势.     

Adaptive direct slicing of a commercial CAD model for use in rapid prototyping

Slicing a 3D graphic model into layers of 2D contour plots is an essential step for all rapid prototyping (RP) machines. Various methods are available, such as stereo lithography (STL) file slicing, direct slicing and adaptive direct slicing. Amongst these, adaptive direct slicing is the most advanced for its capability of adapting the slicing thickness according to the curvature of any contour. In this study, an adaptive direct slicing method complete with the algorithm for calculating the thickness of each layer is proposed. As an illustration of the method, the algorithm was programmed within the commercial CAD software package, PowerSHAPE. The method was shown to be fast and accurate in comparison with STL file slicing and direct slicing, which both used a constant layer thickness. An erratum to this article can be found at     

Adaptive slicing of functionally graded material objects for rapid prototyping

Slicing is a fundamental process planning task and an important procedure in rapid prototyping. However, most research currently focuses on the slicing of homogeneous objects and few approaches for slicing of heterogeneous objects have been reported in the literature. In this article, we present an approach for adaptive slicing of functionally graded material objects. Unlike homogeneous objects, functionally graded material objects contain both geometry and material information. The layer thickness is computed by considering not only geometry but also material variation along the build direction. The continuous material distribution in each layer is discretised into step-wise gradings by subdividing the slice into sub-regions, which can be regarded as homogeneous material regions. An algorithm that summarised the slicing procedure is described and an example is also presented.     

Adaptive direct slicing with non-uniform cusp heights for rapid prototyping

Adaptive slicing varies layer thickness by taking the geometry change of the CAD model in the build direction into account to improve surface finish. Direct slicing generates exact slice contours from the original CAD model and avoids an intermediate representation, known as an STL file. At present, most direct slicing approaches are restricted to some CSG solids or some CAD systems. In this paper, an approach toward adaptive direct slicing with non-uniform cusp heights independent of CAD systems for rapid prototyping is presented. First the geometry model is imported into the adaptive direct slicing system from CAD systems using the standard STEP format. Using OpenGL graphics libraries, the solid model is then displayed and the user is prompted to specify the allowable cusp height for each highlighted surface. Lastly, the CAD model is sliced adaptively with different cusp heights (tolerance requirements) for different surfaces. With non-uniform cusp heights, adaptive slicing has a higher efficiency. Implementation details and results are also presented.     

A fast triangulation algorithm for 3D reconstruction from planar contours

Aiming at the reconstruction of medical images, a fast triangulation algorithm from planar contours (FTA) is proposed in this paper. In FTA, the judgment of the similarity of counters is carried out at first. Then a traditional global optimisation method is applied to triangulating dissimilar counters. A simple local optimisation method is also applied on areas enveloped by line sections of similar counters. Through theoretical analysis and experience, the visual effect of FTA becomes approximately similar to traditional global optimisation methods and its calculating speed is much improved simultaneously. FTA was also applied to a stereo tactical radiation therapy planning system for a gamma knife (SRTPS) developed by the authors.