检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:廖中平[1,2,3] 刘科[1,2] 向雨[2] 蔡晨光[2]
机构地区:[1]道路灾变防治及交通安全教育部工程研究中心(长沙理工大学),长沙410004 [2]长沙理工大学交通运输工程学院,长沙410004 [3]内蒙古申科国土集团公司,呼和浩特010020
出 处:《计算机应用》2016年第7期1933-1937,共5页journal of Computer Applications
基 金:国家自然科学基金资助项目(41471421);道路灾变防治及交通安全教育部工程研究中心开发基金资助项目(kfj110307)~~
摘 要:针对基于切片技术的点云数据重建算法需要提取切片内点云边界点,及现有算法效率低、提取效果不好等问题,提出一种多阈值提取平面点云边界点的算法。通过选取判断点的k个近邻点,计算相邻两点与判断点连线间夹角,由于边界点必存在最大夹角,通过判断最大夹角是否超过设定阈值,从而快速提取边界点。通过对阈值设值分析,不同点云数据的边界提取实验及几种方法间比较,该方法不受点云形状影响,均能较好提取边界点,且优于其他3种算法。结果表明该方法在保证原始点云特征信息的前提下,可较好提取边界点,提高后续点云重建速度与效率。The method of point cloud reconstruction based on slicing technology needs to extract boundary points from slicing planar points. In order to solve the problem of extracting boundary points and overcome the drawback of low efficiency and bad result of current algorithms, a boundary points extraction method of planar point cloud based on multi-threshold was proposed. In the algorithm, k adjacent points were selected from the judged points, then the angle between the nearest points were calculated and the maximum angle was limited because there existed the biggest angle, thus the boundary points could be rapidly extracted. By analyzing the value of multi-threshold, testing the method to extract boundary points of different point cloud and comparing the proposed method with other three methods, the method accurately and better extracted boundary points regardless of the shapes. The experimental results show that the proposed method can well extract the boundary points on the condition of guaranteeing the original characteristic information and improves the speed and efficiency of point cloud reconstruction.
分 类 号:P232[天文地球—摄影测量与遥感] TP391.41[天文地球—测绘科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173