基于区域分割的三角网格模型相似性比较

为了在工程应用中检索已有的三角网格模型,以便重用相应零件的设计信息,节省设计和加工成本,提出一种基于区域分割技术的三角网格模型相似性比较算法。依据三角网格模型的球面图像将模型分割为若干个区域;对每个分割得到的区域用一个10维向量表达其形状的几何特征和拓扑特征,一个三角网格模型的特征即可通过各分割区域所对应的10维向量组成的向量组表达;将该向量组作为三角网格模型的形状描述子,两个三角网格模型的相似性可通过相对应的形状描述子间的相似性表达。将描述子中的每个向量看成是一个带有属性的节点,通过两组节点组成的完全二分图的最优匹配进行两个形状描述子之间的相似性比较,实现两个三角网格模型之间的相似性比较。实验结果表明,该算法有效可行。     

三维网格的边界强度分割算法

提出一种新的基于网格边界几何信息的快速分割算法,首先按照原始网格模型面片的拓扑关系建立对偶图,并根据网格面片的几何信息设定顶点权和边权;使用k-way 多级分割方法在对偶图上进行快速分割,得到预分割区域以及各分割区域的初始边界;然后定义分割片的特征边界和边界强度函数,用以表示各预分割区域边界上的形变模型;通过最小化形变模型的能量函数,推动初始边界向特征边界运动,最终得到符合最小值法则的有意义的子网格.实验结果表明,该算法快速有效,适用于各种局部边缘特点较显著的三角网格模型.     

基于顶点重要度的保形网格简化方法研究

为解决许多网格简化方法不能很好地保持模型的重要几何特征问题,提出基于顶点重要度和三角剖分的边折叠简化算法.算法通过特征因子加权顶点重要度作为边的折叠代价,定义法向量夹角因子,控制边的折叠顺序;在折叠过程中对边界特征区域进行冻结处理,以保持模型总体轮廓特征;采用边中点折叠和边邻域网格重建方法完成折叠操作.实验结果表明,模型在大规模简化后,该方法能较好地保持模型的几何特征.     

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

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

三角网格模型的最小值边界分割

针对目前网格模型块分割算法综合效果不理想、人工干预多等问题,提出一种基于凹凸信号的最小值边界检测的三角网格模型分割算法.首先通过全局控制顶点的Laplace光顺操作对网格模型进行光顺去噪;然后通过标准化和归一化的凹度信息发现符合人眼视觉的最小值规则的凹特征点;最后结合区域中心线提取算法以及扇形探射线算法构造出闭合的分割线,并用三维主动轮廓模型方法进行优化,通过分割线将模型分割为有意义的分块.实例结果表明,该算法可以快速有效地分割模型,得到有意义的分割结果.     

综合曲率约束的在线网格模型分割方法研究

针对现有三角网格模型块分割方法普遍存在计算复杂度高,无法体现工程意义,综合效果不理想,不满足Web环境下高效快速分割等问题,提出一种面向Web环境的简单高效的三角网格模型分割方法。根据高斯曲率和平均曲率特性划分出网格模型的凹区域,在凹区域中依据最小负曲率阈值提取凹特征区域,结合区域中心特征线提取方法以及边界线闭合和优化算法构造出闭合分割线,通过分割线将三角网格模型分割成有意义的分块。依托开源数字几何处理软件MeshLabJS,运用WebGL的几何处理及图形渲染功能,在普林斯顿标准数据集和COSEG形状数据集上进行算法测试,验证所提方法能够在Web环境下快速、高效、有意义地分割三维模型。     

面向可展特征的网格模型去噪方法

可展特征是三维网格模型的常见几何特征。为了更好地对具备可展特征的网格模型进行去噪,提出一种面向可展特征的网格模型去噪方法。首先基于变分形状逼近策略分割可展区域,识别出网格模型上可展特征区域,并对分割区域进行基于可展性度量的合并和划分,改进现有 L 0 去噪算法中针对非均匀噪声网格的正则优化表达项,引入三角网格顶点的可展度量项,利用可展特征的曲面法向量 L 0 范数的优化问题求解实现网格模型的去噪。通过对多个模型数据集中的大量模型数据进行处理,验证了该方法的有效性。实验表明,结合模型的可展特性的去噪方法在保持模型的几何特征特别是可展特征上效果优于已有方法。     

基于保特征调和场的交互式网格分片

网格模型分片在计算机图形学应用中具有重要意义,本文提出了一种基于网格上的调和场和图割技术的网格模型分片算法.用户可以通过划线的方式来指定网格上感兴趣的区域;算法自动构建反映该区域细节特征的调和场,进而采用图割技术,得到满足用户要求的分片结果;通过对网格分割边界的光滑处理,可有效改善锯齿型分割边界.实验结果表明,我们的算法对于特征单一或复杂的网格模型都能得到符合用户意图的分割结果.     

基于泊松方程的孔洞修补算法

传统网格生长法对孔洞数量庞大且孔洞类型复杂的三维网格模型修复效果不佳。针对该问题,将泊松方程应用于三角网格模型的孔洞修补。利用原始模型信息建立泊松方程,对输入模型曲面进行全局拟合,根据孔洞信息裁剪拟合得到的预测曲面并与原始孔洞模型缝合,通过孔洞边界区域法向量信息调整修补曲面的三角面片方向,达到特征增强的目的。实验结果表明,该算法对于结构复杂的多孔洞三维模型修补效果较好,对噪声鲁棒性强,在保留模型原始信息的同时能够准确还原孔洞区域特征。     

基于商空间粒度理论的三维网格分割方法

通过研究已有的网格分割和模型简化方法 ,分析三维模型的网格分割中的商空间粒度思想 ,并将商空间粒度计算引入到网格分割中 ,对网格分割过程进行描述 ,提出了基于粒度分层合成技术的网格分割方法。该算法通过分别提取模型中各三角形网格区域的几何特征构成不同的粒度区域 ,再根据粒度合成理论。将这些所形成的粒度组织起来 ,从而实现对三维网格的最终分割 ,为三角网格模型的简化提供了快速有效的方法。实验表明了该算法对于网格分割的有效性和正确性。     

Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy

This paper presents a segmentation algorithm for 3D triangular mesh data. The proposed algorithm uses iterative merging of adjacent triangle pairs based on their orientations. The oversegmented regions are merged again in an iterative region merging process. Finally, the noisy boundaries of each region are refined. The boundaries of each region contain perceptually important geometric information of the entire mesh model. According to the purpose of the segmentation, the proposed mesh-segmentation algorithm supports various types of segmentation by controlling parameters.     

一种基于特征线的曲面网格分割方法

各类网格分割法将曲面网格进行分割后,各子网格区域之间的交界线便可以作为曲面网格的封闭特征线。相反,如果根据网格模型的几何、拓扑特征,确定了网格模型的封闭特征线后,网格曲面便被这些特征线分割开来。为此,从曲面网格封闭特征线的角度出发,提出一种基于特征线的曲面网格分割方法。实验验证了该方法的可行性和有效性。     

Mesh deformation-based multi-tissue mesh generation for brain images

Multi-tissue meshing is necessary for the realistic building of a biomechanical model of the brain, which has been widely used in brain surgery simulation, brain shift, and non-rigid registration. A two step multi-tissue mesher is developed. First, a coarse multi-tissue mesh is generated by redistributing labels of a body-centered cubic (BCC) mesh. Second, all the surfaces of the submeshes are deformed to their corresponding tissue boundaries. To deform the mesh, two strategies are developed. One is based on a point-based registration (PBR) and the other is based on a robust point matching (RPM). The PBR method explicitly calculates the correspondence, which takes both smoothing and quality into account, then resolves the displacement vector by minimizing an energy function. Unlike PBR method, RPM does not require the correspondence between the source points and the target points to be known in advance. To simultaneously resolve the displacement vector and the correspondence, the Expectation and Maximization optimization is employed to alternately estimate the correspondence and the displacement vector. To effectively cope with outliers, least trimmed square, a robust regression technique, is employed to correct the regression bias induced by outliers. Both methods are effective in deforming the multi-tissue mesh. However, the PBR method favors quality and smoothing, and the RPM method favors fidelity. The resulting mesh is characterized by its flexible control of four mesh properties: (1) tissue-dependent resolution, (2) fidelity to tissue boundaries, (3) smoothness of mesh surfaces, and (4) element quality. Each mesh property can be controlled on a tissue level. Our experiments conducted on synthetic data, clinic MRI, visible human data, and brain atlas effectively demonstrate these features of this multi-tissue mesher.     

A partial mesh replacement technique for design modification in rapid prototyping

Most rapid prototyping machines accept the .STL format as the universal format of the geometric model, where the substance of the .STL format is essentially a triangular model. A partial replacement of the meshes in such a model is practically necessary, but has been received little attention. The purpose of this study is to develop a partial mesh replacement technique for replacing a region of meshes along a closed region of profile. The proposed method is primarily composed of three steps: cutting path computation, mesh segmentation and mesh stitching. The cutting path computation is employed to evaluate the intersecting points of all meshes lying under the projection of the boundary curve. Mesh segmentation is employed to divide the original meshes into two parts: preserved and replaced meshes. Mesh stitching is finally employed to sew the boundaries of the preserved and new meshes. Several examples are presented to demonstrate the feasibility and application of the proposed method.     

基于三维模型球型分割的信息隐藏算法

对于基于三维模型信息隐藏算法在几何攻击中鲁棒性差的问题,提出一种基于三维模型球型分割的信息隐藏算法。首先,利用主元分析、球面坐标转换、球型分割、分区排序等对三维模型进行预处理;然后,计算立体分区中法向量变化较大的点作为特征点,根据待嵌入秘密信息量对特征点进行小波变换;最后,将经过置乱操作的秘密信息嵌入预处理后的载体中生成含密三维模型。实验结果表明,算法不可见性较好,对旋转、随机加噪、重网格以及其他常见攻击具有良好的鲁棒性。     

基于K-means聚类方法的三维点云模型分割

提出采用K-means聚类分析方法对三维点云模型进行分割。论文指出,对于分布呈现类内团聚状三维点云模型,K均值聚类分割可以得到较好的结果。与三维网格模型的K均值聚类分割、点云模型的谱系聚类分割的实验结果比较证实了这一点。     

Simultaneous gesture segmentation and recognition based on forward spotting accumulative HMMs

Existing gesture segmentations use the backward spotting scheme that first detects the end point, then traces back to the start point and sends the extracted gesture segment to the hidden Markov model (HMM) for gesture recognition. This makes an inevitable time delay between the gesture segmentation and recognition and is not appropriate for continuous gesture recognition. To solve this problem, we propose a forward spotting scheme that executes gesture segmentation and recognition simultaneously. The start and end points of gestures are determined by zero crossing from negative to positive (or from positive to negative) of a competitive differential observation probability that is defined by the difference of observation probability between the maximal gesture and the non-gesture. We also propose the sliding window and accumulative HMMs. The former is used to alleviate the effect of incomplete feature extraction on the observation probability and the latter improves the gesture recognition rate greatly by accepting all accumulated gesture segments between the start and end points and deciding the gesture type by a majority vote of all intermediate recognition results. We use the predetermined association mapping to determine the 3D articulation data, which reduces the feature extraction time greatly. We apply the proposed simultaneous gesture segmentation and recognition method to recognize the upper-body gestures for controlling the curtains and lights in a smart home environment. Experimental results show that the proposed method has a good recognition rate of 95.42% for continuously changing gestures.     

残缺网格模型的快速B样条曲面重建

针对残缺的三角网格模型,提出一种将网格模型的散乱数据点转化为有序阵列点再进行B样条曲面快速重建的算法.首先确定最小二乘平面上的一个矩形参数域,再构造出一个平面阵列点列,并部分映射到三维网格上;然后利用空间阵列点的邻域信息估计4个角点的空间坐标,并构造径向基函数曲面,用于补充空间阵列点列中残缺的数据;最后利用有序点列拟合的高效性构造B样条曲面.实验结果表明:该算法速度快、拟合精度高、鲁棒性强,重建的曲面具有良好的光顺性和可延伸性,适用于逆向工程中对经过数据分割后的网格模型的自由曲面重建.     

三角网格模型分治加工中区域分割算法的研究

提出分治加工策略以保证复杂三角网格模型数控加工同时具有较高的加工效率和加工精度;针对分治加工的需求,提出一种将机械零件三角网格模型分割成具有加工意义区域的算法。算法采用半边数据结构,基于区域生长原理,以二面角结合刀轴矢量为区域生长的驱动信号,实现了三角网格模型内子加工区域的快速分割。为了避免过分割现象,实现了小区域或误判区域的优化合并处理算法。运行实例表明了该算法能够有效实现加工模型的区域分割。     

Remeshing into normal meshes with boundaries using subdivision

In this paper, we present a remeshing algorithm using the recursive subdivision of irregular meshes with boundaries. A mesh remeshed by subdivision has several advantages. It has a topological regularity, which enables it to be used as a multiresolution model and to represent an original model with less data. Topological regularity is essential for the multiresolutional analysis of the given meshes and makes additional topological information unnecessary. Moreover, we use a normal mesh to reduce the geometric data size requirements at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e. normal offset as wavelet, to represent a vertex position, while the other remeshing schemes use one three-dimensional vector at each vertex. The normal offset is a normal distance from a base face, which is the simplified original mesh. Since the normal offset cannot be properly used for the boundaries of a mesh, we use a combined subdivision scheme that resolves the problem of the proposed normal offset method at the boundaries. Finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the data requirements of mesh models.