摘要
提出了对版图进行划分的Voronoi图的算法:将Voronoi图进行变换,通过扫描技术,从下到上对每个点与交点进行处理,从而形成变换后的Voronoi图,最后将此图转换为Voronoi图.在计算中,针对集成电路的物理特性,改进了阱区附近的V图的生成以及多个水平位置点和兼并问题.算法时间复杂度为O(nlogn),空间复杂度为O(n).
An algorithm for Voronoi diagram on Integrated Circuit Substrate Coupling Simulation is introduced. The algorithm computes a geometric transformation of Voronoi diagram with sweepline technique. From down to top, by dealing with each site, the transferred Voronoi diagram is constructed. Since the algorithm is linked to Circuit layout, it can compute Voronoi diagram near wells which is suitable for IC physical feature. It can also be used in the case where there are four or more cocircular and /or not unique bottommost sites.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
1999年第2期139-142,共4页
Journal of Computer-Aided Design & Computer Graphics
基金
国家重点科技项目