无线传感器网络中的分布式平面t-支撑拓扑控制算法

在确保无线传感器网络连通的前提下,每个节点自适应地调整自己的发射功率,通过最小化节点的能耗和减少节点间的通信干扰,达到延长网络生存时间的目的.基于 Voronoi划分和局部Delaunay三角剖分,提出一种新的几何结构PSLDel图(planar symmetric local Delaunay triangulation)以及其分布式构造算法,为无线传感器网络建立连通、稀疏、平面、t-支撑的底层逻辑拓扑,每个节点将依据最远的逻辑邻居调整到最小发射功率.仿真实验表明,PSLDel图在逻辑邻居、最小发射功率和通信干扰等性能方面接近集中式构造的UDel图,而且PSLDel图的网络延迟稍微优于 UDel图;与分布式构造的AUDel图相比,PSLDel图的通信开销至少可以降低55%,从而有利于提高无线传感器网络的能量使用效率.     

平面点集三角剖分算法的改进性研究

介绍了三角剖分的基本知识和方法,并且使用VB开发工具实现了一种改进后的三角剖分算法。讨论了现有各种三角剖分之间的优缺点,并对各种剖分进行了系统分析,最终在现有剖分算法的基础上给出了一种散列点密度产生法,使得三角剖分的结果更加合理。     

An investigation into design of fair surfaces over irregular domains using data-dependent triangulation

Design of fair surfaces over irregular domains is a fundamental problem in computer-aided geometric design (CAGD), and has applications in engineering sciences (in aircraft, automobile, ship science etc.). In the design of fair surfaces over irregular domains defined over scattered data, it was widely accepted till recently that the classical Delaunay triangulation be used because of its global optimum property. However, in recent times it has been shown that for continuous piecewise linear surfaces, improvements in the quality of fit can be achieved if the triangulation pattern is made dependent upon some topological or geometric property of the data set or is simply data dependent. The fair surface is desired because it ensures smooth and continuous surface planar cuts, and these in turn ensure smooth and easy production of the surface in CAD/CAM, and favourable resistance properties. In this paper, we discuss a method for construction of C¹ piecewise polynomial parametric fair surfaces which interpolate prescribed ℜ³ scattered data using spaces of parametric splines defined on H³ triangulation. We show that our method is more specific to the cases when the projection on a 2-D plane may consist of triangles of zero area, numerically stable and robust, and computationally inexpensive and fast. Numerical examples dealing with surfaces approximated on plates, and on ships have been presented.     

顾及地形特征的等高线拓扑空间关系表达

在分析以往等高线树在表达地形图等高线拓扑空间关系时既没有考虑局部地形特征(鞍部、山头、洼地等)又不能很好表达等高线与所围区域之间的关系等缺陷的基础上,提出了增加地形特征等高线构建增量等高线树,以同时表达等高线之间、等高线与所围区域之间两种拓扑空间关系.通过建立等高线约束Delaunay三角网,给出了增量等高线树的动态提取算法.研究表明,增量等高线树在地形识别、基于等高线建立数字高程模型、等高线高程自动赋值、等值线充填等方面的表现都优于以往等高线树,具有较大的应用潜力.     

非结构化四面体网格生成方法及改进

对生成三维非结构化网格的D e launay方法进行了分析,给出四面体网格生成的基本步骤.改进判断非结构化网格质量的方法,提出采用四面体单元无量纲棱长的标准差对网格质量进行评价.对于已经生成的初始化网格,在棱长标准差最大的四面体单元内加入新点重新构造网格,反复进行迭代直到所有的标准差小于设定值.该方法比较灵活且易于实现.通过不同的算例对网格生成及改进方法进行了验证,获得了理想的结果.     

基于可见性约束的自动表面重构算法研究

提出了一种基于可见性约束的自动表面重构算法.此算法首先介绍了一种通过插入法实现的3维Delaunay三角网自动重构算法,然后利用给定的离散点,构建包围所有点的凸包.在完成初始的Delaunay三角剖分基础上,提出了利用特征点在影像中的可见性信息,对初始的3维模型进行修正,从而得到物体的实际表面模型.实验结果表明,该方法是有效的.     

Efficient surface reconstruction from contours based on two‐dimensional Delaunay triangulation

This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the two‐dimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general framework. Natural distance interpolations are performed in order to complete the mapping of the added intermediate points. Surface smoothing and remeshing are conducted to optimize the initial surface triangulations. Several examples are presented to demonstrate the effectiveness and efficiency of the proposed approach. Copyright © 2005 John Wiley & Sons, Ltd.     

Text region extraction in a document image based on the Delaunay tessellation

In this paper, Delaunay triangulation is applied for the extraction of text areas in a document image. By representing the location of connected components in a document image with their centroids, the page structure is described as a set of points in two-dimensional space. When imposing Delaunay triangulation on these points, the text regions in the Delaunay triangulation will have distinguishing triangular features from image and drawing regions. For analysis, the Delaunay triangles are divided into four classes. The study reveals that specific triangles in text areas can be clustered together and identified as text body. Using this method, text regions in a document image containing fragments can also be recognized accurately. Experiments show the method is also very efficient.     

二维对流扩散方程基于三角形网格的特征差分格式

引言 对流扩散方程描述了众多的物理现象,其数值算法研究一直受到重视11一叩3一‘4].在这方面,特征差分方法和特征有限元方法是非常有效的两种方法[1一6}.特征差分方法计算简单,但适应区域不够灵活.特征有限元方法则对矩形区域或一般区域均可得到令人满意的结果,但特征有限     

基于径向基函数多步离散数据插值的人脸变形研究

文章介绍了如何把基于径向基函数多步离散数据插值的方法用在人脸变形技术上,该方法是在对脸部定义的特征点进行分层的基础上,和已知特征点位移的条件下,利用一种基于迭代的插值方法求出特征点周围的网格点位移,从而进行人脸变形。这种方法既保证了脸部局部区域变形的精确性和平滑性,又减少了运算的复杂度。在人脸动画方面该算法也得到了广泛的应用。