确定网格上的最大k-宽度连通性

Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI:10.1109/IPPS.1992.223040

Susanne E. Hambrusch, F. Dehne

{"title":"确定网格上的最大k-宽度连通性","authors":"Susanne E. Hambrusch, F. Dehne","doi":"10.1109/IPPS.1992.223040","DOIUrl":null,"url":null,"abstract":"Let I be a n*n binary image stored in a n*n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of pixels of value 'I' there exists a path of width k (composed of 1-pixels only). The authors consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Determining maximum k-width-connectivity on meshes\",\"authors\":\"Susanne E. Hambrusch, F. Dehne\",\"doi\":\"10.1109/IPPS.1992.223040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let I be a n*n binary image stored in a n*n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of pixels of value 'I' there exists a path of width k (composed of 1-pixels only). The authors consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.223040\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

假设我是一个n*n个二进制图像存储在n*n个处理器的网格中，每个处理器一个像素。如果在任意一对值为“I”的像素之间存在一条宽度为k的路径(仅由1个像素组成)，则图像I是k-宽度连接的。作者考虑了使I是k-宽度连接的最大整数k的确定问题，并提出了一种最优的O(n)时间网格结构算法。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Determining maximum k-width-connectivity on meshes

Let I be a n*n binary image stored in a n*n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of pixels of value 'I' there exists a path of width k (composed of 1-pixels only). The authors consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.<>

求助全文

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

来源期刊

Proceedings Sixth International Parallel Processing Symposium

自引率

0.00%

发文量

期刊最新文献

Parallel heap: improved and simplified Assignment of ADT modules to processors Formal derivation of an efficient parallel 2-D Gauss-Seidel method Analyzing performance of sequencing mechanisms for simple layered task systems An optimal parallel algorithm for arithmetic expression parsing