基于紧密中心性的无线mesh骨干网网关部署

将定向天线和Delaunay图应用于无线mesh骨干网络的网关部署,提出了基于紧密中心性的无线mesh骨干网络网关部署算法。根据已知的mesh路由器和网关的最大流通量对网络进行划分,形成Delaunay子图,在划分的子图中根据欧几里德距离找出距离中心点最近的3个节点,形成候选网关集,在候选网关集中选择到其他节点总路径最短的节点作为网关的部署位置,将每个子图的网关位置输出。仿真结果表明,根据网关最大流通量进行合理网络划分后,算法能最小化网络的网关数量,由mesh路由器到网关的总路径长度优于随机算法。     

一种火炮炮膛锥度的光电检测方法

基于激光光三角位移检测技术和光栅位移检测技术,提出一种用于Φ30 mm火炮炮膛锥度光电非接触检测方法,并据此研制了小口径火炮炮膛锥度光电检测系统。论述了系统的组成和总体结构,对炮膛锥度的测量方法、系统检测原理进行了理论分析,着重阐述了利用激光光三角原理非接触测量内径尺寸的方法,并通过实验对测量系统的精度和可行性进行了验证。实验结果表明：检测系统精度优于±0.003 mm,重复性精度优于±0.002 mm,能够满足小口径火炮炮膛锥度的检测精度要求,该检测方法切实可行。     

带断层海量数据的Delaunay三角剖分算法研究

海量地震数据网格化是三维地质建模的常用方法.断层是普遍的地质现象,带断层的海量数据三角剖分在建模中较为复杂.提出一种简单的可以解决带断层Delaunay三角剖分有效算法.该算法首先对数据边界进行初始Delaunay三角剖分,然后将其变尺度加密,生成较均匀三角网,最后将断层边强行嵌入三角网,实现了三角网格化.     

Enhancing multisensor data fusion on light sectioning coordinate measuring systems for the in-process inspection of freeform shaped parts

A method for automatic determination of sensors positions and orientations in multisensor laser triangulation coordinate measuring systems is presented. Based on a series of measurements on a conical artifact without the use of external light sources, the approach allows for both optimized adjustment of the physical sensors alignment and improved 3D data registration by software. Simulations were conducted to quantify the sensitivity of the method. Experimental results based on measurements of steep details of complex shaped parts show a 5-times reduction of deviations between measurements of sensors with respect to an already optimized adjustment by manual methods.     

基于C#和AutoCAD的Delaunay三角剖分算法的实现

本文是在.net平台下AutoCAD二次开发方面的文章,是对Delaunay三角剖分算法的总结。在算法的编程实现过程中,作者提出了许多新颖的设想,并最终获得了正确的计算结果和理想的时间效率。针对算法实现的整体框架和步骤,几个算法关键点以及算法的时间复杂度方面,文中提供了比较详细的论述。     

Molecular Surface Modeling and Meshing

An increasingly important part of quantum chemistry is devoted to molecular surfaces. To model such a surface, each constituting atom is idealized by a simple sphere. Surface mesh generation techniques are then used either for visualization or for simulation, where mesh quality has a strong influence on solution accuracy. This paper presents our new approach to generating quality meshes on arbitrary molecular surfaces (van der Waals, solvent-accessible or solvent-excluded surfaces). First, a boundary representation (B-rep) of the surface is obtained, i.e. a set of patches and the topological relations between them. Second, an appropriate parameterization and a metric map are computed for each patch. Third, meshes of the parametric domains are generated with respect to an induced metric map, using a combined advancing-front – generalized-Delaunay approach. Finally these meshes are mapped onto the entire surface. Several application examples illustrate various capabilities of our method. ID="A1" Correspondence and offprint requests to: P. Laug, GAMMA project, INRIA, BP 105, 78153 Rocquencourt Cedex, France. E-mail: Patrick.Laug@inria.fr     

Efficient Generation of Conforming Voronoi Polygonal Surface Mesh

A novel construction algorithm is presented to generate a conforming Voronoi mesh for any planar straight line graph (PSLG). It is also extended to tesselate multiple-intersected PSLGs. All the algorithms are guaranteed to converge. Examples are given to illustrate its efficiency.     

一种基于等高线生成三维地形的实用方法

本文详细介绍由等高线地形图数据生成三维地形的基本原理和过程,具体实现方法是通过等高线数字化获取离散点的高程数据,采用Delaunay三角网进行三维建模,然后进行三维显示,从而生成的三维地形。并以VisualC++6.0为开发平台,OpenGL为工具,建立了基于等高线数据的三维地形模型。实验证明本文所述方法速度快、精度高。     

基于Delaunay三角剖分的Ad Hoc网络路由算法

Delaunay三角剖分已广泛地应用于计算流体力学、统计学、气象学、固体物理学、计算几何学等多个领域.随着无线Ad Hoc网络的发展,一些研究者提出了可以保证网络任意节点对之间分组顺利传输的几何路由协议,而这些协议的网络基础拓扑同样可以用Delaunay三角剖分的思想来实现.提出了一种新型的用于发现移动节点间通信路径的在线路由算法GLNFR(greedy and local neighbor face routing).利用局部构造法,构造出局部化的Delaunay三角剖分作为网络的基础拓扑.在该网络拓扑中进行的GLNFR路由算法可以保证节点间分组的顺利传输,对网络变化具有更好的可扩展性和适应性.在NS(network simulator)模拟器上仿真了该路由算法.结果表明,在分组成功传输率和路由分组开销性能方面,这一在线路由协议要优于先前提出的一些几何路由协议.     

基于非结构三角网格的两种自适应技术研究

实现两种基于无结构Delaunay三角网格的自适应方法，并且把两种方法分别应用于求解一个典型的二维溃坝问题，同时对两种方法的数值结果和稳定性进行比较。数值结果表明两种方法对提高数值解的精度和调整问题求解区域的剖分起到明显的作用。