{"title":"Distributed Reconstruction of Implicit Surfaces","authors":"M. Wahab, A. S. Hussein, A. Aziz","doi":"10.1109/ICCES.2006.320417","DOIUrl":null,"url":null,"abstract":"This paper presents an approach to use the partition of unity technique associated with the radial basis technique to provide implicit surface reconstruction over a distributed environment. The proposed algorithm acquires all the advantages of the partition of unity with better performance and capability of reconstructing surfaces from larger data sets. The global large implicit surface reconstruction problem is partitioned into smaller independent radial basis functions fitting problems. These local problems are distributed over the processing nodes solved independently then the recombined together over the master processing node using the partition of unity. The experimental results for the benchmark models demonstrated that the proposed algorithm can reduce the total radial basis functions fitting time with about 66% using 10 processing nodes. Also, the large models with size of O(106)points can be reconstructed with acceptable reconstruction time","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Computer Engineering and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2006.320417","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper presents an approach to use the partition of unity technique associated with the radial basis technique to provide implicit surface reconstruction over a distributed environment. The proposed algorithm acquires all the advantages of the partition of unity with better performance and capability of reconstructing surfaces from larger data sets. The global large implicit surface reconstruction problem is partitioned into smaller independent radial basis functions fitting problems. These local problems are distributed over the processing nodes solved independently then the recombined together over the master processing node using the partition of unity. The experimental results for the benchmark models demonstrated that the proposed algorithm can reduce the total radial basis functions fitting time with about 66% using 10 processing nodes. Also, the large models with size of O(106)points can be reconstructed with acceptable reconstruction time