共查询到20条相似文献,搜索用时 140 毫秒
1.
提出了对版图进行划分的Voronoi图的算法:将Voronoi图进行变换,通过扫描技术,从下到上对每个点与交点进行2,从而形成变换后的Voronoi图,最后将此图转换为Voronoi图。在 计算中,针对集成电路的物理特性,改进了阱区附近的V图的生成以及多个水平位置点和兼并问题。算法时间复杂度为O(nlogn)空间复杂度为O(n)。 相似文献
2.
线段加权的Voronoi图 总被引:19,自引:0,他引:19
本文将点上加权的Voronoi图推广到线段上加权的Voronoi图,证明了该图的两线段间的Voronoi边是二次曲线,给出了所有情形下两线段间的Voronoi边的具体形状和画法及线段加权的Voronoi图Vn的画法。 相似文献
3.
基于Voronoi图理论的自由边界型腔加工路径规划 总被引:4,自引:3,他引:4
Voronoi图是计算几何研究中的一个有力工具。给出了基于Voronoi图和单调区划分的型腔数控加工环切轨迹规划算法,并首次将其应用于边界为自由曲线的型腔,提高了Voronoi图在该领域的应用价值。 相似文献
4.
面条目标Voronoi图生成的动态距离变换策略 总被引:3,自引:0,他引:3
利用Vector-based方法生成的矢量Voronoi图用于GIS有局限性,那么自然而然就会想到能否在栅格空间中生成栅格Voronoi图,与之对应的生成算法被称作Rastir-basid方法。本文首先介绍了与Raster-based方法有关的研究工作,在此基础上提出用传统的距离变换建立栅格Voronoi图,而后又指出这种方法建立Vouonoi图引起的误差与距离成线性正比关系,为减小误差,作者提出 相似文献
5.
本文提出了一种基于图的平面点集Delaunay三角剖分算法。该算法首先求出平面点集的欧几里得最小生成树,然后逐次加入一边构造三角形网格,最后按最小内角最大的三角化准则,通过局部变换,得到平面点集的Delaunay三角剖分。本文同时阐述了它的对偶图;平面点集的Voronoi图的概念和性质。 相似文献
6.
7.
完全欧几里德距离变换的最优算法 总被引:12,自引:2,他引:12
欧几里德距离变换(EDT)对由黑白素构成的二值图象中所有象素找出其到最近黑素的距离,应用于图象分析,计算机视觉,在本文之前,该问题的最好复杂度为O(n^2logn)。本文提出了一个复杂度为O(n^2)的算法,使复杂度达到最优,该算法可以并行化,在有r个处理单元的EREWPRAM计算模型上,若rlogr≤22/6n,则时间复杂度为O(n/r)否则为O(nlogr)。 相似文献
8.
9.
基于Wormhole路由的二维Mesh上的并行k-选择 总被引:1,自引:1,他引:1
由于二维网孔机器的结构简单、规整,易于VLSI实现,使得它不仅成为许多理论研究的基础模型,而且还是许多并行机所采用的互连结构.Worm hole 路由技术的采用改进了二维网孔机器的通信能力.该文在带有Worm hole 路由技术的n×n 二维网孔机器上提出了一个时间复杂度为O(log2nloglogn)的并行k-选择算法,改进了该问题在Store-and-Forw ard 路由技术下的时间复杂度下界O(n).据已掌握的资料,该算法为最早的、非总线连接的二维网孔机器上的、时间复杂度为对数的多项式级的k-选择算法. 相似文献
10.
可重构造的网孔机器上的k-选择 总被引:2,自引:0,他引:2
对于一个 m ×n(m ≤k)的列有序矩阵,文中在 n × n 可重构造的网孔机器上提出了一个并行 k选择算法,其时间复杂度为 O(log2m + logm log2 n+ log3 n),而对于一般的l元集,文中在相同的模型下提出了一个时间复杂度为 O log2 ln + log ln log2 n+ log3n+ ln log ln 的并行 k选择算法.当时 l≥ O(nlog3n/log logn,该时间复杂度为 O ln log ln .特别地,当l= O(n1+ ε)(ε> 0 为常数),则时间复杂度为 O ln logn .此时达到的加速比为 n/logn. 相似文献
11.
分区加权Voronoi图是Voronoi图和加权Voronoi图的推广,可以用来模拟移动通信中基站发射天线分扇区以不同功率向周围发射时所覆盖区域的形状。首先,给出了分区加权Voronoi图的性质、定理及相关证明;其次,分析了分区加权Voronoi图中的各种区域,并给出了一种计算相应区域面积的算法;最后,利用分区加权Voronoi图模拟石家庄市部分城区中的基站建设情况,并对模拟产生的重复覆盖、服务区和盲区面积进行了计算。 相似文献
12.
Region-expansion for the Voronoi diagram of 3D spheres 总被引:1,自引:0,他引:1
Donguk Kim Author Vitae 《Computer aided design》2006,38(5):417-430
Given a set of spheres in 3D, constructing its Voronoi diagram in Euclidean distance metric is not easy at all even though many mathematical properties of its structure are known. This Voronoi diagram has been known for many important applications from science and engineering. In this paper, we characterize the Voronoi diagram of spheres in three-dimensional Euclidean space, which is also known as an additively weighted Voronoi diagram, and propose an algorithm to construct the diagram. Starting with the ordinary Voronoi diagram of the centers of the spheres, the proposed region-expansion algorithm constructs the desired diagram by expanding the Voronoi region of each sphere, one after another. We also show that the whole Voronoi diagram of n spheres can be constructed in O(n3) time in the worst case. 相似文献
13.
带线段障碍的城市Voronoi图生成算法研究 总被引:1,自引:0,他引:1
带线段障碍的城市Voronoi图是城市Voronoi图的扩展.在步行或使用一般交通工具的情况下,客观世界中存在着许多不能逾越的障碍,甚至连交通网络也时常被一些障碍隔开.许多障碍可简化为线段障碍来处理.给出带线段障碍的城市Voronoi图的定义、性质,结晶生长算法和实例.算法简单,可扩展性好,具有较高的理论价值和应用价值. 相似文献
14.
针对分段线性复合形约束条件下的三维限定Voronoi剖分问题,提出一种细化算法.首先证明了分段线性复合形中的元素在最终生成的三维限定Voronoi网格中可表示为Power图结构;受此启发,提出了对限定线段平面片分别进行一维二维Power图细化以实现三维限定Voronoi 网格生成的细化算法,并且证明了该算法对于任意分段线性复合形收敛.最后通过实例验证了文中算法的有效性. 相似文献
15.
Despite its important applications in various disciplines in science and engineering, the Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclidean Voronoi diagram for 3D spheres with different radii. The presented algorithm follows Voronoi edges one by one until the construction is completed in O(mn) time in the worst-case, where m is the number of edges in the Voronoi diagram and n is the number of spherical balls. As building blocks, we show that Voronoi edges are conics that can be precisely represented as rational quadratic Bézier curves. We also discuss how to conveniently represent and process Voronoi faces which are hyperboloids of two sheets. 相似文献
16.
论文提出一种基于点集自适应分组构建Voronoi 图的并行算法,其基本思
路是采用二叉树分裂的方法将平面点集进行自适应分组,将各分组内的点集独立生成
Voronoi 图,称为Voronoi 子图;提取所有分组内位于四边的边界点,对边界点集构建Voronoi
图,称为边界点Voronoi 图;最后,针对每个边界点,提取其位于Voronoi 子图和边界点Voronoi
图内所对应的两个多边形,进行Voronoi 多边形的合并,最终实现子网的合并。考虑到算法
耗时主要在分组点集的Voronoi 图生成,而各分组的算法实现不受其他分组影响,采用并行
计算技术加速分组点集的Voronoi 图生成。理论分析和测试表明,该算法是一个效率较高的
Voronoi 图生成并行算法。 相似文献
17.
18.
面元加权Voronoi图是生成元为面元的加权Voronoi图。针对大规模数据情况下面元加权Voronoi图存在的计算效率不高问题,结合面元边界点提取方法,提出一种基于Hadoop云平台的面元加权Voronoi图的并行生成算法,进行了单机和集群实验。实验结果表明,算法能有效处理大规模栅格数据,明显提高面元加权Voronoi图的生成速度。还可应用于城市绿地设计规划,为绿地设计提供决策依据。 相似文献
19.
This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm. 相似文献
20.
Sequeira R.E. Preteux F.J. 《IEEE transactions on pattern analysis and machine intelligence》1997,19(10):1165-1170
The Voronoi diagram (VD) is a popular tool for partitioning the support of an image. An algorithm is presented for constructing VD when the seed set, which determines the Voronoi regions, can be modified by adding and removing seeds. The number of pixels and seeds revisited for updating the diagram and the neighbor relationships among seeds is minimized. A result on cocircular seeds is presented. The adjacency, or dual, graph of the VD is readily obtained. The use of the algorithm for constructing skeletons by influence zones (SKIZ) is demonstrated 相似文献