四叉树运算的超立方算法

The Sixth Distributed Memory Computing Conference, 1991. Proceedings Pub Date : 1991-04-28 DOI:10.1109/DMCC.1991.633113

R. Shankar, S. Ranka

{"title":"四叉树运算的超立方算法","authors":"R. Shankar, S. Ranka","doi":"10.1109/DMCC.1991.633113","DOIUrl":null,"url":null,"abstract":"This paper describes parallel algorithms for the following operations on qua.dtreesboolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a. hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit. [( eywords: Qua.dtrees, Hypercube algorithms, Image processing","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"144 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Hypercube Algorithms for Operations on Quadtrees\",\"authors\":\"R. Shankar, S. Ranka\",\"doi\":\"10.1109/DMCC.1991.633113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes parallel algorithms for the following operations on qua.dtreesboolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a. hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit. [( eywords: Qua.dtrees, Hypercube algorithms, Image processing\",\"PeriodicalId\":313314,\"journal\":{\"name\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"volume\":\"144 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1991.633113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

本文描述了qua上下列操作的并行算法。Dtreesboolean操作(并，交，补)，折叠四叉树，以及在四叉树表示的图像中查找邻居。本文假设的体系结构是一个超立方体，每个超立方体节点有一个处理元素(PE)。我们假设体系结构是SIMD的，也就是说，所有pe都在单个控制单元的控制下工作。[关键词]权;d树，超立方体算法，图像处理

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

查看原文本刊更多论文

Hypercube Algorithms for Operations on Quadtrees

This paper describes parallel algorithms for the following operations on qua.dtreesboolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a. hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit. [( eywords: Qua.dtrees, Hypercube algorithms, Image processing

求助全文

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

来源期刊

The Sixth Distributed Memory Computing Conference, 1991. Proceedings

自引率

0.00%

发文量