基于Voronoi图的物流园区腹地的界定

为了更加科学合理的确定物流园区的规模,提出了在物流园区规划建设的前期应先行界定物流园区腹地的理念.针对引力模型、势能模型和断裂点模型等传统腹地界定方法所存在的划分过程缺乏精确连续性的缺陷,引入了计算几何中的Voronoi图理论对物流园区的腹地进行了界定,并运用GIS软件中的Voronoi图生成工具,结合成都市物流园区规划的实例进行了理论模型的应用.结果证明基于GIS软件运用该方法的操作较为简便,具有较高的应用价值.     

基于3D Voronoi模型形状不规则度组合梯度泡沫金属的动态冲击力学性能研究

泡沫金属的力学性能与其细观结构参数密切相关.四个形状不规则度参数梯度组合的3 D Voronoi结构模型被用于开展动态冲击数值仿真实验,探究不同冲击速度下形状不规则度梯度组合类型对泡沫金属的变形特性、荷载-位移和能量吸收特性的影响.结果表明,冲击速率仅在临界速度范围内时对形状不规则度梯度组合模型的力学性能有明显影响,沿...     

基于Voronoi图的机器人复杂装配新策略

提出了一种基于Voronoi图技术的机器人复杂装配的新策略；在机器人装配研究中引入形象思维方式，即集成Voronoi图技术；装配知识的表示采用Voronoi图方式，通过Voronoi分析对机器人复杂装配过程进行有效规划，从而形成机器人关于装配过程的所有过程；机器人于通过力觉和力控制来感知装配件之间的精确物理关系，并调整装配件的位姿，实施基于Voronoi图知识的机器人装配，实验证明，该方法是有效的。     

New Voronoi Diagram Algorithm of Multiply-Connected Planar Areas in the Selective Laser Melting

This paper studies the practical generation of Voronoi diagrams for multiply-connected planar areas bounded by line segments. The core of the algorithm was calculating Voronoi polygon of every Voronoi object in planar areas independently. The main approach had two steps. The first step was calculating all relevant bisectors of every Voronoi object. The second was combining obtained bisectors into completed Voronoi polygons individually. All code was implemented in Visual C++ platform. The resulting code was extensively tested in real-world data and its practical running time grew only linearly. Three statistical CPU-consumption charts had been drawn with the Voronoi diagrams computation data, and compared with other published codes for computing Voronoi diagrams. The algorithm was applied to compute offsetting of slice area consisting of large-scale line segments for the selective laser melting (SLM) trajectory scanning technology which is a kind of rapid prototyping (RP). The experimental results of offsetting for slice area based on Voronoi diagrams show that the approach is effective and simple for polygon offsetting problems. The method is helpful to those offsetting work and can provide more effective offsetting solution.     

Coverability of Wireless Sensor Networks

The coverability of Wireless Sensor Networks (WSNs) is essentially a Quality of Service (QoS) problem that measures how well the monitored area is covered by one or more sensor nodes.The coverability of WSNs was examined by combining existing computational geometry techniques such as the Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques.Three new evaluation algorithms,known as CRM (Comprehensive Risk Minimization),TWS (Threshold Weight Shortest path),and CSM (Comprehen...     

一种用于模式识别的多色Voronoi图

提出了一种新的Voronoi图———多色Voronoi图 ,并证明了它的一些重要性质。多色Voronoi图是在Voronoi图的构造过程中 ,根据数据集的特性给Voronoi图染色的结果。用多色Voronoi图概念设计的模式分类器(MCVC)是一种非线性多类别最优分类器 ,可以解决线性可分和线性不可分问题 ,同时MCVC对新增加的训练样本具有快速局部学习能力 ,这种局部学习能力克服了神经网络方法常出现的过学习问题 ,很类似于人对概念的学习。将多色Voronoi图概念用于支撑矢量机的构造中 ,进行支撑矢量的预选取 ,可以提高支撑矢量机的学习速度     

A novel method for robot path planning

Path planning is one of the most important problems in the design of a mobile robot. A novel approach called generalized Voronoi diagrams (GVD) may deal with this matter. First, a method was introduced to normalize the obstacles and present efficient techniques for generating GVDs. Then a best path searching algorithm was presented. Examples implemented were given to indicate the availability of the mentioned algorithms. The approaches in this paper can also be used in applications including visualization, spatial data manipulation, etc.     

关于Voronoi图的一个不等式

提出并证明了关于Ｖｏｒｏｎｏｉ图的一个新性质：设Ｓ是平面上任一有限点集，ｄｓ是Ｓ中最近两点之间的距离，ｐ是Ｓ中任一点，Ｖ（ｐ）是关联于ｐ的Ｖｏｒｏｎｏｉ多边形，Ａ（ｐ）是Ｖ（ｐ）的面积，则Ａ（ｐ）≥３１／２２ｄ２ｓ．     

一种支持三维Delaunay三角剖分与Voronoi图生成的数据结构

目前,很多三维Voronoi图生成算法都是先构造Delaunay三角剖分,然后根据剖分后的数据结构来提取出Voronoi信息。在这个过程中,一种简单易处理的数据结构可以提高算法的效率,而在提取Voronoi信息时需要这种数据结构提供足够多的拓扑信息,以便快速简便地提取Voronoi信息。因此一种易于处理而又保有足够多拓扑信息的数据结构显得尤为重要。描述了一种数据结构,使Delaunay三角剖分算法的实现更加直观、简单,而且足够的拓扑信息简化了Voronoi信息的提取过程。