{"title":"平面图设计中高效的形状曲线构造","authors":"Ting-Chi Wang, D. F. Wong","doi":"10.1109/EDAC.1991.206424","DOIUrl":null,"url":null,"abstract":"The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.<<ETX>>","PeriodicalId":425087,"journal":{"name":"Proceedings of the European Conference on Design Automation.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient shape curve construction in floorplan design\",\"authors\":\"Ting-Chi Wang, D. F. Wong\",\"doi\":\"10.1109/EDAC.1991.206424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.<<ETX>>\",\"PeriodicalId\":425087,\"journal\":{\"name\":\"Proceedings of the European Conference on Design Automation.\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the European Conference on Design Automation.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDAC.1991.206424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the European Conference on Design Automation.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDAC.1991.206424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient shape curve construction in floorplan design
The authors present an efficient algorithm to construct shape curves for VLSI floorplans. Their algorithm is based on extensions of a tree-restructuring technique and a curve-adding technique. They assume each module in the floorplan has an infinite number of non-redundant implementations specified (or approximated) by a piecewise linear decreasing shape curve. Their algorithm constructs a shape curve that contains all non-redundant implementations of the floorplan. Experimental results indicate that the algorithm performs well.<>