基于空间数据结构的二维平面重叠矩形平面扫描算法

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI:10.1109/CMPSAC.1990.139379

P.-Y. Hsiao, Chia-Chun Tsai

{"title":"基于空间数据结构的二维平面重叠矩形平面扫描算法","authors":"P.-Y. Hsiao, Chia-Chun Tsai","doi":"10.1109/CMPSAC.1990.139379","DOIUrl":null,"url":null,"abstract":"The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"278 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane\",\"authors\":\"P.-Y. Hsiao, Chia-Chun Tsai\",\"doi\":\"10.1109/CMPSAC.1990.139379\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<<ETX>>\",\"PeriodicalId\":127509,\"journal\":{\"name\":\"Proceedings., Fourteenth Annual International Computer Software and Applications Conference\",\"volume\":\"278 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings., Fourteenth Annual International Computer Software and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1990.139379\",\"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., Fourteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1990.139379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

提出了一种基于区域查询操作的空间数据结构平面扫描算法。该算法适用于超大规模集成电路版图设计和图像处理问题。它的计算时间为O(N log N)，允许空间数据结构的区域搜索的功能操作在解决某些特定问题时是有用的。该算法已在C语言中成功实现;它基于两种空间数据结构;多存储四叉树和四叉列表四叉树。该平面扫描算法还成功地应用于布局压缩、设计规则检查和最小可靠分区等问题。

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

查看原文本刊更多论文

A new plane-sweep algorithm based on spatial data structure for overlapped rectangles in 2-D plane

The authors present a novel plane-sweep algorithm based on spatial data structures with region query operations. Such an algorithm is applicable to the problems of VLSI layout design and image processing. It has a computing time of O(N log N) and allows the functional operations of region search of the spatial data structures to be useful in solving some of the specified problems. This algorithm has been successfully implemented in C language; it was based on two kinds of spatial data structures; multiple storage quad tree and quad list quad tree. This plane-sweep algorithm also has been successfully applied to problems of layout compaction, design rule checking, and minimum reliable partition.<>

求助全文

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

来源期刊

Proceedings., Fourteenth Annual International Computer Software and Applications Conference

自引率

0.00%

发文量