螺旋平面设计的最优算法

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors Pub Date : 1991-10-14 DOI:10.1109/ICCD.1991.139962

Cheng-Hsi Chen, I. Tollis

{"title":"螺旋平面设计的最优算法","authors":"Cheng-Hsi Chen, I. Tollis","doi":"10.1109/ICCD.1991.139962","DOIUrl":null,"url":null,"abstract":"An improved algorithm for solving the area optimization problem of spiral floorplans is presented. Each of the five basic rectangles of a spiral floorplan have O(n) implementations. The algorithm takes O(n/sup 2/logn) time, and requires O(n/sup 2/) space to solve the area optimization problem. The best previously known algorithm solved the problem in O(n/sup 3/logn) time and O(n/sup 3/) space.<<ETX>>","PeriodicalId":239827,"journal":{"name":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"An optimal algorithm for spiral floorplan designs\",\"authors\":\"Cheng-Hsi Chen, I. Tollis\",\"doi\":\"10.1109/ICCD.1991.139962\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An improved algorithm for solving the area optimization problem of spiral floorplans is presented. Each of the five basic rectangles of a spiral floorplan have O(n) implementations. The algorithm takes O(n/sup 2/logn) time, and requires O(n/sup 2/) space to solve the area optimization problem. The best previously known algorithm solved the problem in O(n/sup 3/logn) time and O(n/sup 3/) space.<<ETX>>\",\"PeriodicalId\":239827,\"journal\":{\"name\":\"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCD.1991.139962\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1991.139962","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

提出了一种求解螺旋平面平面面积优化问题的改进算法。螺旋平面的五个基本矩形中的每一个都有O(n)个实现。该算法耗时O(n/sup 2/logn)，求解面积优化问题需要O(n/sup 2/)空间。目前已知的最佳算法在O(n/sup 3/logn)时间和O(n/sup 3/)空间内解决了这个问题。

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

查看原文本刊更多论文

An optimal algorithm for spiral floorplan designs

An improved algorithm for solving the area optimization problem of spiral floorplans is presented. Each of the five basic rectangles of a spiral floorplan have O(n) implementations. The algorithm takes O(n/sup 2/logn) time, and requires O(n/sup 2/) space to solve the area optimization problem. The best previously known algorithm solved the problem in O(n/sup 3/logn) time and O(n/sup 3/) space.<>

求助全文

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

来源期刊

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors

自引率

0.00%

发文量