空间点集Voronoi图的海量构造算法及可视化技术

设计空间点集Voronoi图的增量式外存算法以及空间点集Voronoi图的任意平面可视化剖分技术,以"点-线-面-体"的空间数据结构为基础,实现在指定空间区域内生成Voronoi图的新方法.提出的算法数据结构清晰合理,数据交互方案简单有效且无内存限制,发展的可视化技术可以对空间点集Voronoi图进行任意的平面剖分,实现了三维Voronoi晶胞集合体内部结构的可视化.     

基于Voronoi图的空间区域划分算法

考虑到空间划分的复杂性,将有限维分布不均匀的空间划分为均匀的空间是一个很复杂的过程.针对Voronoi图诸多性质中的最近邻特性,提出利用Voronoi图划分空间区域,定义了一个单位覆盖空间,运用点替换规则和迭代法划分空间,并将分块区域内的点集标记颜色,位于同一分块内的点有相同的特性,从而把平面或维空间划分为有周期性或准...     

一个基于桶技术的平面点集Voronoi图增量算法

设计并实现了一个有效的平面Voronoi图增量算法 .该算法以翼边数据结构为基础 ,应用桶技术选择生成子并提高近邻搜索效率 ,可处理平面点集三点共线、四点共圆等退化情形 ,并具有较高的计算精度 .尽管理论上算法的最坏时间复杂性为O(n2 ) ,实验结果表明算法的平均时间复杂性近似为O(n) .     

基于平面多边形Voronoi图的算法与快速成形应用

探讨了平面多边形的Voronoi图的性质,提出了一种新的求解平面多边形的Voronoi图的算法,其核心思想是单独考虑每个Voronoi图对象,分开计算其分治区,然后再构成一个具有拓扑关系的Voronoi图.这种计算方法较其他现有算法(比如二分法)大幅度提高了求解Voronoi图的成功率,在VC 平台上得到了实现,并应用于快速成形的等距线扫描工艺中.该算法求解平面切片的轮廓的Voronoi图和生成等距线速度快,可以实时生成切片轮廓的全部等距线.试验证明:算法可以减少制件特别是类似大平面制件的翘屈变形,提高制件整体质量.     

加权Voronoi区域面积的计算方法

加权Voronoi图是Voronoi图定义的扩展.加权Voronoi区域的面积是加权Voronoi图的一个重要的物理属性.给出了加权Voronoi区域面积的计算方法,即对给定的母点坐标和权重,先求出各Voronoi区域边界上相邻两顶点间的Voronoi边的属性数据,并将每个闭合边界上的属性数据存放在一个循环链表中,最后根据各个循环链表中的数据,计算出各加权Voronoi区域的面积.     

Voronoi图的扩展、生成及其应用于界定城市空间影响范围

在总结国内外文献的基础上，提出了常规Voronoi图的两种扩展形式，即线的加权Voronoi图和面的加权Voronoi图，并在地理信息系统软件Are/Info的支持下，实现了基于栅格方法的若干类Voronoi图的自动构建，这种方法可以处理任意图形的线状和面状发生元情形。以界定河南省城市空间影响范围为例，尝试了发生元为离散点集的常规Voronoi图和国权Voronoi图应用于界定城市空间影响范围的试验研究。     

基于ArcGIS环境下多类型数据的三角网和Voronoi图的生成

基于渐次插入算法,在ArcGIS环境下,提取居民地中心点和道路中心线上的点作为离散点,实现了对这些离散点的Delaunay三角网的构建和数据的有效组织,利用ArcGIS提供的接口生成了Voronoi图,实现了多类型数据Delaunay三角网和Voronoi图的生成。     

左转算法在间接法生成Voronoi图中的应用

就利用左转算法间接法生成Voronoi图进行了初步的探讨,首先用贪心算法进行平面的三角剖分,然后使用左转算法构建Delaunay三角网,再生成Voronoi图.实践证明使用这种方法在编写程序时程序结构更容易理解和稳定.     

基于空间改进型Voronoi图的路径规划研究

三维空间路径规划在某些特殊情况下必不可少，如无人机为了降低敌雷达的探测概率，利用山谷或其他特殊地形飞行.在原有基于平面Voronoi图的路径规划基础上，将Voronoi图的概念进行了推广，提出了“空间改进型Voronoi图”的概念.研究了不同威胁体下“空间改进型Voronoi图”构图的一些基本原则，包括不同威胁体下“空间改进型Voronoi图”作图法，以及突发威胁体下空间局部路径重规划区域原则和空间局部最优路径选择原则等.仿真结果表明整个模型构架的基本思路可行.     

间接法生成Voronoi图的设计与实现

设计出存储有点、线、面、Voronoi多边形等对象拓扑关系的数据结构,通过边扩展算法先构成Delaunay三角网.在此基础上引入凸包生成算法,生成Voronoi图,Voronoi图是GIS空间分析中一个重要的工具.     

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.     

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.     

一种基于混合索引的HDFS小文件存储策略

Hadoop分布式文件系统(hadoop distributed file system,HDFS)因其稳定高效、低成本等优势,已被很多大型企业广泛使用.针对HDFS海量小文件存储时元数据服务器节点内存开销过大,合并文件中小文件访问效率不高的问题,提出一种改进的基于混合索引的小文件存储策略,应用分类器分类标记小文件,并在元数据服务器建立H-B+树索引,在存储节点根据小文件大小建立不同的块内索引,达到提高小文件访问效率的目标.实现中采用缓存结构,以提高客户端访问的响应速度,同时也有利于元数据服务器节点的内存负载.实验结果表明,基于混合索引的小文件存储策略能有效提高小文件访问效率,并显著降低元数据节点内存开销.     

Massive infection and loss of memory CD4+ T cells in multiple tissues during acute SIV infection

It has recently been established that both acute human immunodeficiency virus (HIV) and simian immunodeficiency virus (SIV) infections are accompanied by a dramatic and selective loss of memory CD4+ T cells predominantly from the mucosal surfaces. The mechanism underlying this depletion of memory CD4+ T cells (that is, T-helper cells specific to previously encountered pathogens) has not been defined. Using highly sensitive, quantitative polymerase chain reaction together with precise sorting of different subsets of CD4+ T cells in various tissues, we show that this loss is explained by a massive infection of memory CD4+ T cells by the virus. Specifically, 30-60% of CD4+ memory T cells throughout the body are infected by SIV at the peak of infection, and most of these infected cells disappear within four days. Furthermore, our data demonstrate that the depletion of memory CD4+ T cells occurs to a similar extent in all tissues. As a consequence, over one-half of all memory CD4+ T cells in SIV-infected macaques are destroyed directly by viral infection during the acute phase-an insult that certainly heralds subsequent immunodeficiency. Our findings point to the importance of reducing the cell-associated viral load during acute infection through therapeutic or vaccination strategies.     

基于嵌入式的文件系统研究

为解决传统FAT格式文件数据按顺序存取方式无法适应在大容量存储设备中大规模目录文件的读取查询操作等问题, 在嵌入式文件系统中采用磨损平衡算法及位图存储技术对NandFlash存储介质实现Flash域磨损优化, 并对嵌入式文件系统的索引存储和空闲目录进行优化管理。系统使用仿真器进行仿真程序开发, 并在基于ARM9 MagicARM2410开发板进行仿真实验。实验结果表明, 该文件系统能实现其基本功能, 其可行性得到验证。     

用于视频图像数据的ATA接口硬盘存储卡的设计

给出一种视频图像数据ATA接口硬盘存储卡的设计方案,系统采用模块化设计,由图像数据缓冲模块、ATA逻辑模块、ATA接口模块、主机通信模块四部分组成。图像数据缓冲模块选用CPLD加外部FIFO的组合方式来完成,使得系统与不同的外部设备配合工作时,只需要修改CPLD的程序,提高了存储卡的可靠性和可维护性;ATA逻辑模块以及ATA接口模块的功能通过FPGA实现;主机通信模块由AVR芯片配合TUSB6250芯片来共同完成,保证了存储卡具有功耗低、内部短路电路保护等优点。本文所提存储卡方案具有更低的成本,更好地兼容性,易于扩展等优势,尤其适用于视频海量数据的存储。     

基于Voronoi图的无人机快速航迹规划研究

Voronoi图的快速构建是快速完成基于Voronoi图的航迹规划的关键。针对Voronoi图构建效率不高的问题,提出了一种快速构建Voronoi图的方法。首先,利用改进的Bowyer-Watson算法构建Delaunay三角网。在确定待插入点的影响域时,引入bool类型的数组对已构建三角网中的三角形是否为Delaunay三角形进行标记,从而缩小三角形的遍历范围,加快Delaunay三角网的构建速度。然后用间接法得到Voronoi图。此外,对航迹规划过程中起始航迹和终止航迹的确定进行了讨论,完成了基于Voronoi图的无人机航迹规划。结果表明,采用提出的间接法能快速完成Voronoi图的构造。当母点(威胁点)为20 000个时,只需要20 s的时间。对快速完成无人机的航迹规划具有重要的意义。     

海量数据分析及处理算法实现

随着科学技术的发展,计算机的计算能力每年也都在飞快增长,需要处理的数据量更是呈指数级的增长。这样,对海量数据的分析处理是当今的重要话题之一。在实际应用中,因为笔者需要处理csv文本文件中的海量数据,数据量至少在25M以上,并要求处理时间能达到客户的需求,所以设计了一种快速处理海量数据的算法。该算法中包括对海量数据的提取...