一种基于多边形分解的网络表示方法

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers Pub Date : 1988-11-07 DOI:10.1109/ICCAD.1988.122498

C. Chi

{"title":"一种基于多边形分解的网络表示方法","authors":"C. Chi","doi":"10.1109/ICCAD.1988.122498","DOIUrl":null,"url":null,"abstract":"A method of decomposing polygons into convex subpolygons is presented. The result gives accurate polygon areas and maintains the tree-structure relationships of net branches represented by the polygon. Contacts which connect polygons on different layers are used. The whole net can be represented in a backward linklist. An implementation for treating signal delay in an RC tree network is discussed.<<ETX>>","PeriodicalId":285078,"journal":{"name":"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A method for net representation with polygon decomposition\",\"authors\":\"C. Chi\",\"doi\":\"10.1109/ICCAD.1988.122498\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method of decomposing polygons into convex subpolygons is presented. The result gives accurate polygon areas and maintains the tree-structure relationships of net branches represented by the polygon. Contacts which connect polygons on different layers are used. The whole net can be represented in a backward linklist. An implementation for treating signal delay in an RC tree network is discussed.<<ETX>>\",\"PeriodicalId\":285078,\"journal\":{\"name\":\"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCAD.1988.122498\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCAD.1988.122498","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种将多边形分解为凸子多边形的方法。结果给出了精确的多边形面积，并保持了多边形所表示的网分支的树状结构关系。使用连接不同图层上的多边形的触点。整个网络可以用一个反向链表来表示。讨论了一种处理RC树网络中信号延迟的实现方法

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A method for net representation with polygon decomposition

A method of decomposing polygons into convex subpolygons is presented. The result gives accurate polygon areas and maintains the tree-structure relationships of net branches represented by the polygon. Contacts which connect polygons on different layers are used. The whole net can be represented in a backward linklist. An implementation for treating signal delay in an RC tree network is discussed.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers

自引率

0.00%

发文量