{"title":"Fast simplification with sharp feature preserving for 3D point clouds","authors":"H. Benhabiles, O. Aubreton, H. Barki, Hedi Tabia","doi":"10.1109/ISPS.2013.6581492","DOIUrl":null,"url":null,"abstract":"This paper presents a fast point cloud simplification method that allows to preserve sharp edge points. The method is based on the combination of both clustering and coarse-to-fine simplification approaches. It consists to firstly create a coarse cloud using a clustering algorithm. Then each point of the resulting coarse cloud is assigned a weight that quantifies its importance, and allows to classify it into a sharp point or a simple point. Finally, both kinds of points are used to refine the coarse cloud and thus create a new simplified cloud characterized by high density of points in sharp regions and low density in flat regions. Experiments show that our algorithm is much faster than the last proposed simplification algorithm [1] which deals with sharp edge points preserving, and still produces similar results.","PeriodicalId":222438,"journal":{"name":"2013 11th International Symposium on Programming and Systems (ISPS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 11th International Symposium on Programming and Systems (ISPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPS.2013.6581492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28
Abstract
This paper presents a fast point cloud simplification method that allows to preserve sharp edge points. The method is based on the combination of both clustering and coarse-to-fine simplification approaches. It consists to firstly create a coarse cloud using a clustering algorithm. Then each point of the resulting coarse cloud is assigned a weight that quantifies its importance, and allows to classify it into a sharp point or a simple point. Finally, both kinds of points are used to refine the coarse cloud and thus create a new simplified cloud characterized by high density of points in sharp regions and low density in flat regions. Experiments show that our algorithm is much faster than the last proposed simplification algorithm [1] which deals with sharp edge points preserving, and still produces similar results.