首页> 中文期刊> 《智能计算机与应用》 >针对路面建模的Delaunay三角网格分治算法

针对路面建模的Delaunay三角网格分治算法

         

摘要

In order to obtain a three-dimensional model of road, using Delaunay triangulation divide and conquer algorithm to process road cloud data, according to the characteristics of the road surface point cloud, z coordinate is not considered in point cloud partition.Use Delaunay triangulation divide and conquer algorithm to process different sizes of point cloud data and record the time required to generate triangulation, collect point cloud data of a section of road and use Delaunay triangulation algorithm to process, propose comparison model whether to match with the scanned pavement.Delaunay triangulation divide and conquer algorithm generates triangulation quickly, but it needs a lot of time when dealing with large scale point cloud data, and the triangular mesh generated by Delaunay triangulation algorithm can fit the pavement for the three-dimensional surface modeling.%为了对路面进行三维建模,使用Delaunay三角网分治算法处理路面点云数据,根据路面点云的特点,对点云进行划分中不考虑z坐标.使用Delaunay三角网分治算法处理不同规模的点云数据并记录生成三角网所需的时间,收集一段路面的点云数据并使用Delaunay三角网算法进行处理,观察生成的三角网是否和扫描的路面匹配.Delaunay三角网分治算法能够较快地生成三角网,但是在处理大规模点云数据时仍需消耗很多时间,同时针对路面三维建模问题,Delaunay三角网分治算法所生成的三角网能够很好地拟合路面.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号