Optimum node positioning in adaptive grid refinement and the Delaunay-Voronoi algorithm [semiconductor process simulation]

C. Pladdy, I. Avci, M. Law
{"title":"Optimum node positioning in adaptive grid refinement and the Delaunay-Voronoi algorithm [semiconductor process simulation]","authors":"C. Pladdy, I. Avci, M. Law","doi":"10.1109/SISPAD.2000.871248","DOIUrl":null,"url":null,"abstract":"This paper presents a method for optimum placement of nodes in grid generation for process simulation together with an algorithm for updating the grid after each addition of a new node to ensure that the Delaunay property is satisfied. Placement of nodes is decided by considering the optimum error in evaluating the integral /spl int//sub V/ C(x)dx. The best error estimate is obtained when the node coincides with the centroid (the center of mass) of its own Voronoi region and moreover when the Voronoi region is symmetric. After addition of a node, the grid is updated to maintain the Delaunay property using the Delaunay-Voronoi algorithm.","PeriodicalId":132609,"journal":{"name":"2000 International Conference on Simulation Semiconductor Processes and Devices (Cat. No.00TH8502)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 International Conference on Simulation Semiconductor Processes and Devices (Cat. No.00TH8502)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SISPAD.2000.871248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a method for optimum placement of nodes in grid generation for process simulation together with an algorithm for updating the grid after each addition of a new node to ensure that the Delaunay property is satisfied. Placement of nodes is decided by considering the optimum error in evaluating the integral /spl int//sub V/ C(x)dx. The best error estimate is obtained when the node coincides with the centroid (the center of mass) of its own Voronoi region and moreover when the Voronoi region is symmetric. After addition of a node, the grid is updated to maintain the Delaunay property using the Delaunay-Voronoi algorithm.
自适应网格细化中的最优节点定位与Delaunay-Voronoi算法[半导体工艺仿真]
本文提出了一种过程仿真网格生成中节点的优化布置方法,并提出了在每增加一个新节点后更新网格以保证满足Delaunay属性的算法。通过考虑积分/spl int//sub V/ C(x)dx的最优误差来决定节点的位置。当节点与自身Voronoi区域的质心重合时,以及Voronoi区域对称时,误差估计最佳。添加节点后,使用Delaunay- voronoi算法更新网格以维护Delaunay属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信