激光雷达数据的Delaunay三角网格简化算法研究进展分析  

Research progress and analysis of Delaunay triangular mesh simplification algorithm for lidar data

作　　者：侯竞夫 Hou Jingfu(University of Nottingham,Nottingham UK,NG72RD)

机构地区：[1]诺丁汉大学,英国诺丁汉NG72RD

出　　处：《电子测试》2022年第17期44-47,55,共5页Electronic Test

摘　　要：激光雷达以激光扫描为原理,在成功获取对象的三维坐标信息后通过算法重现出来,因此激光雷达会获取相对凌乱且数量庞大的信息,对这些信息的有效处理是其发挥良好观测效用的关键。目前主要通过Delaunay三角剖分算法进行激光雷达扫描所得数据的分析处理,基于该算法模型开展简化算法研究,确定最合适的计算流程,能够在保障准确性的同时实现对三角网格算法的简化,进而推动激光雷达的实际应用效果。Lidar is based on the principle of laser scanning.After successfully obtaining the three-dimensional coordinate information of the object,it is reproduced by algorithm.Therefore,lidar will obtain relatively messy and large amount of information.The effective processing of these information is the key to its good observation effect.At present,the Delaunay triangulation algorithm is mainly used to analyze and process the data scanned by lidar.The simplified algorithm research is carried out based on the algorithm model to determine the most appropriate calculation process,which can simplify the triangular mesh algorithm while ensuring the accuracy and promote the practical application effect of lidar.

关 键 词：激光雷达 数据 DELAUNAY三角剖分 算法简化 研究进展 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]