{"title":"基于三维点云数据的表面重构算法在工业设计中的应用","authors":"Y. Haibo","doi":"10.1109/ICRIS.2017.51","DOIUrl":null,"url":null,"abstract":"At present, rapid reconstruction of amounts of point cloud data is still scarce, so is for the time complexity and space complexity in current methods. This article puts forward an adaptive rasterizing-based triangular mesh reconstruction towards amounts of data simplification reconstruction for storage and transmission. Our measure improves the region expansion: first, macro-estimation method with various points non-difference will obtain 3D grid of side length and separate point cloud data into grid unit. Then, by selecting data points in basic units as seed point and setting triangle side length to approximate positive neighborhood as restriction in order to construct initial triangle grid. Finally, triangle grid reconstruction is completed by layer-by-layer expansion. From experimental results it can be seen, point cloud simplification in high density is faster in reconstruction speed and it has effective robustness.","PeriodicalId":443064,"journal":{"name":"2017 International Conference on Robots & Intelligent System (ICRIS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Industrial Design Applications of Surface Reconstruction Algorithm Based on Three Dimensional Point Cloud Data\",\"authors\":\"Y. Haibo\",\"doi\":\"10.1109/ICRIS.2017.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"At present, rapid reconstruction of amounts of point cloud data is still scarce, so is for the time complexity and space complexity in current methods. This article puts forward an adaptive rasterizing-based triangular mesh reconstruction towards amounts of data simplification reconstruction for storage and transmission. Our measure improves the region expansion: first, macro-estimation method with various points non-difference will obtain 3D grid of side length and separate point cloud data into grid unit. Then, by selecting data points in basic units as seed point and setting triangle side length to approximate positive neighborhood as restriction in order to construct initial triangle grid. Finally, triangle grid reconstruction is completed by layer-by-layer expansion. From experimental results it can be seen, point cloud simplification in high density is faster in reconstruction speed and it has effective robustness.\",\"PeriodicalId\":443064,\"journal\":{\"name\":\"2017 International Conference on Robots & Intelligent System (ICRIS)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Robots & Intelligent System (ICRIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRIS.2017.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Robots & Intelligent System (ICRIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRIS.2017.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Industrial Design Applications of Surface Reconstruction Algorithm Based on Three Dimensional Point Cloud Data
At present, rapid reconstruction of amounts of point cloud data is still scarce, so is for the time complexity and space complexity in current methods. This article puts forward an adaptive rasterizing-based triangular mesh reconstruction towards amounts of data simplification reconstruction for storage and transmission. Our measure improves the region expansion: first, macro-estimation method with various points non-difference will obtain 3D grid of side length and separate point cloud data into grid unit. Then, by selecting data points in basic units as seed point and setting triangle side length to approximate positive neighborhood as restriction in order to construct initial triangle grid. Finally, triangle grid reconstruction is completed by layer-by-layer expansion. From experimental results it can be seen, point cloud simplification in high density is faster in reconstruction speed and it has effective robustness.