三维实体仿真建模的网格自动生成方法

有限元网格模型的生成与几何拓扑特征和力学特性有直接关系。建立网格模型时，为了更真实地反映原几何形体的特征，在小特征尺寸或曲率较大等局部区域网格应加密剖分；为提高有限元分析精度和效率，在待分析的开口、裂纹、几何突变、外载、约束等具有应力集中力学特性的局部区域，网格应加密剖分。为此，该文提出了基于几何特征和物理特性相结合的网格自动生成方法。该方法既能有效地描述几何形体，又能实现应力集中区域的网格局部加密及粗细网格的均匀过渡。实例表明本方法实用性强、效果良好。     

多尺度非均匀渐进网格压缩编码研究

在边折叠网格简化算法的基础上,提出一种多尺度非均匀渐进网格简化算法。该算法不仅简化速度快,而且克服了传统算法在简化模型中网格分布均匀、无法突出模型重要特征的不足之处。该算法在模型的折叠、拐角、凹凸等表达特征的地方,采用的三角形网格面积较小、数量较多;而在平坦等不突出模型特征区域的三角形网格面积较大、数量较少。在简化程度较大的情况下仍然能够保持原始网格的几何特征和视觉特征。由于采用了渐进式多尺度的编码方式,再通过流式传输技术,就可以使采用这种算法生成的模型文件高效、方便地以渐进方式在网络上进行传输。     

三维有限元网格尺寸场光滑化的优化模型和算法

针对单元尺寸值过渡剧烈会导致有限元网格包含低质量单元的问题,提出基于优化原理的单元尺寸场光滑化理论及对应的几何自适应四面体网格生成算法.首先输入CAD模型,生成一套覆盖模型内部的非结构背景网格;然后结合用户参数计算背景网格点上的曲率和邻近特征,以获得自适应CAD模型几何特征的初始单元尺寸场;再以最小化初始单元尺寸场的改变为目标,以单元尺寸值过渡受控为约束,通过求解一类凸优化问题光滑初始尺寸场;最后以光滑后的尺寸场为输入,先后在CAD模型表面与内部生成曲面网格和实体网格.实验结果表明,文中算法仅需5个用户参数,即可在给定CAD模型内部全自动生成高质量的四面体网格.     

任意平面域上内部特征约束的变密度三角化方法

基于Delaunay三角化方法和前沿生成方法，给出了具有任意内部特征的平面域变密度三角形网格生成方法，针对不同的内部特征，可任意设定其网格尺寸，通过加权平均，有效地控制网格的尺寸变化，最终实现了网格的疏密光滑过渡。     

基于矢量场的二维区域全自动四边网格生成

为了实现任意二维几何模型的高质量分块结构四边形网格自动生成,提出一种基于矢量场的二维区域全自动分解方法.首先利用边界元法求解拉普拉斯型控制方程,获取一个反映模型边界几何特征、覆盖整个问题域的矢量场;然后结合矢量与标架的映射关系,将计算得到的矢量场转化为标架场;最后通过分析标架场的奇异结构将问题域分解成多个四边子区域,并在每个子区域利用映射法生成高质量的结构四边形网格.通过复杂区域的网格生成实例,验证了该方法的有效性和可靠性.     

二维自适应前沿推进网格生成

针对二维平面问题,通过曲率计算和基于中轴理论的邻近特征计算控制区域边界曲线的离散;修改经典的前沿推进算法,利用边界驱动的单元尺寸控制方式在区域内部布置疏密过渡合理的三角网格;结合几何和拓扑策略提升网格质量。实验表明,上述算法可生成单元质量高、尺寸过渡合理的计算网格。     

基于多尺度网格模型的物流配送中心选址候选集构建方法

针对物流配送中心选址候选集构建中的地理区域离散化问题,提出一种基于k-增长多尺度网格模型的选址区域离散化方法,根据区域选址敏感度不同,进行尺度差异化网格划分．在此基础上,提出了多尺度网格投影及膨胀算法,识别并剔除“限制性区域”及距其指定范围内的多尺度网格．数值实验表明了所提出的模型及算法的有效性．     

结合局部区域特征的自适应简化率网格简化算法

现有的网格简化算法通常要求人为给定模型整体简化率或者设置几何、颜色、纹理等属性的约束,如何合理地设置这些阈值对没有经验的用户来说比较困难.文中结合监督学习的方法,构建一个多层感知机模型来实现局部区域自适应简化率的预测.该感知机模型能根据网格模型不同区域的局部几何特性,提取出相应的特征,并根据这些特征进行分类.不同的分类对应着不同的简化率,从而在简化网格时根据分类对不同区域设置不同的法线偏差阈值,实现自适应简化率的网格简化算法.为证明该算法的效果,实验中选择不同种类和复杂程度的三维网格模型进行了简化,并与基于QEM能量函数的简化算法进行了整体简化率和简化后的视觉效果的实验对比,结果表明,相对于传统整体简化算法,这种基于局部区域特征设置自适应简化终止条件阈值的简化算法,能有效地根据几何特性对网格进行自适应简化,在保持模型细节的同时,提高了网格的整体简化率.     

几何自适应参数曲面网格生成

为满足有限元分析的需要,针对参数曲面提出一种几何自适应的网格生成方法.通过黎曼度量控制下的曲面约束Delaunay三角化获得曲面中轴,将其用于自动识别曲面邻近特征,并通过曲率计算自动识别曲率特征;根据邻近特征和曲率特征,融合传统网格尺寸控制技术控制边界曲线离散,并创建密度场;结合映射法和前沿推进技术对组合参数曲面生成几何自适应的网格.实验结果表明,该方法能够处理复杂的几何外形,生成的网格具有很好的自适应效果和质量.     

一种基于区域分割的几何模型简化方法

根据几何模型简化中保持细节特征的要求,引入了图像的区域分割原理,提出了一种利用曲度进行区域生长的网格模型区域分割方法,用A型种子或B型种子进行生长,将模型分割为一些区域;在此基础之上,提出了一种基于区域分割的几何模型简化方法,各个区域按照三角形数目的比例进行简化.该方法在保持模型细节特征的基础之上,大大地加快了模型简化的速度;另外还提出了一种累进网格模型的实现方法,实现了具有细节特征的多分辨模型间的层次过渡.实验证明本文所提出的几何模型简化方法加快了网格模型的简化速度,并具有保持模型的三角形网格密度分布的特点,是一种实用、方便和有效的简化方法.     

基于多尺度非局部约束的单幅图像超分辨率算法

多尺度结构自相似性是指图像中的大量物体具有相同尺度以及不同尺度相似结构的性质.本文提出了一种基于多尺度非局部约束的单幅图像超分辨率算法,结合多尺度非局部方法和多尺度字典学习方法将蕴含在图像多尺度自相似结构中的附加信息加入到重建图像中.多尺度非局部方法在图像金字塔的不同层中搜索相似图像块,并利用多尺度相似图像块间的关系建立非局部约束项,通过正则化约束获取多尺度自相似结构中的附加信息;多尺度字典学习方法将图像金字塔作为字典学习的样本,通过字典学习使样本中的多尺度相似图像块 在字典下具有稀疏表示形式,从而获取多尺度自相似结构中的附加信息.实验表明, 与ScSR、SISR、NLIBP、CSSS、ASDSAR和mSSIM等算法相比,本文的算法取得了更好的超分辨率重建效果.     

Numerical simulation of pyroclastic density currents using locally refined Cartesian grids

Pyroclastic density currents are ground hugging, hot, gas–particle flows representing the most hazardous events of explosive volcanism. Their impact on structures is a function of dynamic pressure, which expresses the lateral load that such currents exert over buildings. Several critical issues arise in the numerical simulation of such flows, which involve a rheologically complex fluid that evolves over a wide range of turbulence scales, and moves over a complex topography. In this paper we consider a numerical technique that aims to cope with the difficulties encountered in the domain discretization when an adequate resolution in the regions of interest is required. Without resorting to time-consuming body-fitted grid generation approaches, we use Cartesian grids locally refined near the ground surface and the volcanic vent in order to reconstruct the steep velocity and particle concentration gradients. The grid generation process is carried out by an efficient and automatic tool, regardless of the geometric complexity. We show how analog experiments can be matched with numerical simulations for capturing the essential physics of the multiphase flow, obtaining calculated values of dynamic pressure in reasonable agreement with the experimental measurements. These outcomes encourage future application of the method for the assessment of the impact of pyroclastic density currents at the natural scale.     

多尺度集值决策信息系统

集值信息系统中的对象的属性值多值化,可以实现对复杂信息更全面的刻画.在传统的集值信息系统中,每个属性只有一个尺度.但在具体应用中,人们往往需要在不同的尺度上处理和分析数据.为此,将多尺度信息系统的粒度转换函数引入集值信息系统中,建立多尺度集值信息系统的理论框架,并讨论该系统的不同尺度间信息粒、粗糙集的关系.在此基础上,...     

Meshing of porous foam structures on the micro-scale

A semi-automatic block-structured grid generation technique for hexahedral meshing of porous open cell Kelvin foam structures for investigation of the pore scale fluid flow is presented. The performance of the algorithm is compared with a tetrahedral full automatic Delaunay meshing technique. In the first part of the paper the meshing strategies are explained. In the second part grid generation times, simulation times and the mesh quality are evaluated. For this Computational Fluid Dynamics (CFD) simulations for both a diffusion-dominated case (Re = 0.129) and a convection-dominated case (Re = 129) are carried out and analysed on four different cell resolutions of each mesh type. For the quality evaluation three different a posteriori error estimates are studied for the two mesh types on the different mesh sizes. The results are: the block-structured grid generation technique is about 10–20 times faster than the tetrahedral full automatic technique. While the mean field error estimates are comparable for both meshes, the maximum field error estimates for the block-structured meshes are only half of those for the tetrahedral meshes. Reaching simulation results of the same quality the hexahedral mesh needs about 20–40% less iterations with comparable mesh sizes. The time per iteration for the hexahedral meshes are up to 94% smaller than for the tetrahedral meshes. This makes the semi-automatic block-structured grid generation technique especially suitable for parameter studies and for the investigation of micro-scale flows in foam structures consisting of large quantities of Kelvin cells.     

Procedural CAD Model Edge Tolerance Negotiation for Surface Meshing

Geometrical models output from CAD software often require modification before they may be used for analysis-quality mesh generation. This is due primarily to the inconsistencies in tolerances used by the CAD operator and the tolerances required for analysis. This paper presents a method for construction of watertight surface meshes directly on imperfect non-modified CAD models. The method is based on a hierarchical grid topology structure that defines a surface mesh by a grid and a collection of curves defining the boundary. Curve boundaries on component surfaces are iteratively split and merged according to user-set tolerances, allowing adjacent surface meshes to become computationally watertight via their shared edge curves. The collection of watertight surface meshes may then be made model-inde-pendent through interactive agglomeration of the surface meshes, followed by refinement and decimation sweeps to remove artifacts of original surface edges. Interactive procedures used for difficult cases are also explained, as are ongoing efforts for further automation.     

一种基于逻辑栅格的网格自动生成算法

针对基于栅格法对表面变动较大的模型进行网格划分适应性差的问题,提出一种基于逻辑栅格的六面体网格自动生成算法。该算法对基于栅格法的思想进行改进,避开一次生成模型初始栅格,将模型离散为一系列截面,对相邻截面采用矢量求交方法形成一对截面的初始栅格,修正初始栅格形成两截面之间的一层网格,形成整体模型。采用改进的栅格法进行复杂地形拱坝坝肩块体网格自动生成,取得较好的效果,结果证明改进的栅格法对复杂地形适应性强,模型表面变动较大时能自动进行网格退化。     

Persistence Analysis of Multi-scale Planar Structure Graph in Point Clouds

Modern acquisition techniques generate detailed point clouds that sample complex geometries. For instance, we are able to produce millimeter-scale acquisition of whole buildings. Processing and exploring geometrical information within such point clouds requires scalability, robustness to acquisition defects and the ability to model shapes at different scales. In this work, we propose a new representation that enriches point clouds with a multi-scale planar structure graph. We define the graph nodes as regions computed with planar segmentations at increasing scales and the graph edges connect regions that are similar across scales. Connected components of the graph define the planar structures present in the point cloud within a scale interval. For instance, with this information, any point is associated to one or several planar structures existing at different scales. We then use topological data analysis to filter the graph and provide the most prominent planar structures. Our representation naturally encodes a large range of information. We show how to efficiently extract geometrical details (e.g. tiles of a roof), arrangements of simple shapes (e.g. steps and mean ramp of a staircase), and large-scale planar proxies (e.g. walls of a building) and present several interactive tools to visualize, select and reconstruct planar primitives directly from raw point clouds. The effectiveness of our approach is demonstrated by an extensive evaluation on a variety of input data, as well as by comparing against state-of-the-art techniques and by showing applications to polygonal mesh reconstruction.     

Triangulation of <Emphasis Type="Italic">p</Emphasis>-Order Parametric Surfaces

The generation of triangulations on p-order parametric surfaces is a fundamental first step to numerical solutions for multidomain problems involving complex geometries such as those encountered in biological fluid dynamics and other applications. In this study we develop a novel, computationally efficient method for generating triangulations in computational space, which, under parametric mapping, are of high geometric quality. Computational efficiency is maintained over parametric orders (p) through approximating the parametric surface by a grid of simplified vector functions. Unlike other length metric approximations, a maximum bound on the error introduced to the calculation of lengths by this approximation is defined to ensure the fidelity of the transformation. This technique is applied to three parametric functions which demonstrate its robustness in handling high mesh distortions, singularities, and high order surfaces. Further, three complex high-order biological finite element meshes are triangulated. High mesh quality and a linear relationship between triangle generation and CPU time is observed for each of these meshes.