{"title":"基于特征提取的散点云简化","authors":"X. Peng, Wenming Huang, P. Wen, Xiaojun Wu","doi":"10.1109/WGEC.2009.12","DOIUrl":null,"url":null,"abstract":"Simplification of scattered point cloud is one of the key preprocessing technologies in reverse engineering. Most simplification algorithms always lose geometric feature excessively in the process. On the basis of feature extraction, a new algorithm is proposed for the simplification of scattered point cloud with unit normal vectors. First, points in point cloud are distributed into uniform cubes. Next, bounding spheres are constructed with their centers at each point; accordingly K-nearest neighbors are searched in the relevant sphere. Later, a specified function is defined to measure the curvature of each point so that feature points can be extracted. Finally, feature points and non-feature points are simplified according to the radius of bounding sphere and the threshold of normal vectors' inner product. The experiments show that the proposed algorithm has the advantages of fast speed and high reservation of the geometric feature of point cloud.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"164 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Simplification of scattered point cloud based on feature extraction\",\"authors\":\"X. Peng, Wenming Huang, P. Wen, Xiaojun Wu\",\"doi\":\"10.1109/WGEC.2009.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Simplification of scattered point cloud is one of the key preprocessing technologies in reverse engineering. Most simplification algorithms always lose geometric feature excessively in the process. On the basis of feature extraction, a new algorithm is proposed for the simplification of scattered point cloud with unit normal vectors. First, points in point cloud are distributed into uniform cubes. Next, bounding spheres are constructed with their centers at each point; accordingly K-nearest neighbors are searched in the relevant sphere. Later, a specified function is defined to measure the curvature of each point so that feature points can be extracted. Finally, feature points and non-feature points are simplified according to the radius of bounding sphere and the threshold of normal vectors' inner product. The experiments show that the proposed algorithm has the advantages of fast speed and high reservation of the geometric feature of point cloud.\",\"PeriodicalId\":277950,\"journal\":{\"name\":\"2009 Third International Conference on Genetic and Evolutionary Computing\",\"volume\":\"164 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Third International Conference on Genetic and Evolutionary Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WGEC.2009.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third International Conference on Genetic and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WGEC.2009.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simplification of scattered point cloud based on feature extraction
Simplification of scattered point cloud is one of the key preprocessing technologies in reverse engineering. Most simplification algorithms always lose geometric feature excessively in the process. On the basis of feature extraction, a new algorithm is proposed for the simplification of scattered point cloud with unit normal vectors. First, points in point cloud are distributed into uniform cubes. Next, bounding spheres are constructed with their centers at each point; accordingly K-nearest neighbors are searched in the relevant sphere. Later, a specified function is defined to measure the curvature of each point so that feature points can be extracted. Finally, feature points and non-feature points are simplified according to the radius of bounding sphere and the threshold of normal vectors' inner product. The experiments show that the proposed algorithm has the advantages of fast speed and high reservation of the geometric feature of point cloud.