{"title":"PVM implementation of quadtree building algorithms on SIMD hypercube system","authors":"H. Suresh","doi":"10.1109/ICAPP.1995.472277","DOIUrl":null,"url":null,"abstract":"Representation of data using hierarchical data structures is commonly used in applications such as computer graphics, digital image processing, computer vision and techniques are being evolved for efficient representation of these data. Transforming bilevel images to linear quadtrees is a way of representing the high-volume data. In this paper, the preliminary investigation and results thus obtained for transforming binary images to linear quadtrees using Parallel Virtual Machine System Software are presented. Single Instruction Multiple Data hypercube algorithms implemented using PVM software was tested under DOS operating system on IBM compatible PCs. The quadtree algorithm generates locational codes in pre-order and generally runs in O(log n) time and this paper tested the feasibility of achieving this time for an SIMD machine.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Representation of data using hierarchical data structures is commonly used in applications such as computer graphics, digital image processing, computer vision and techniques are being evolved for efficient representation of these data. Transforming bilevel images to linear quadtrees is a way of representing the high-volume data. In this paper, the preliminary investigation and results thus obtained for transforming binary images to linear quadtrees using Parallel Virtual Machine System Software are presented. Single Instruction Multiple Data hypercube algorithms implemented using PVM software was tested under DOS operating system on IBM compatible PCs. The quadtree algorithm generates locational codes in pre-order and generally runs in O(log n) time and this paper tested the feasibility of achieving this time for an SIMD machine.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
