基于KD树和CDT的露天矿三维建模  

3D Modeling of Surface Mine Based on KD-Tree and CDT

作　　者：杨青[1] 张亮[1] 王振[1] 

机构地区：[1]山东科技大学研究生教育学院,山东青岛266510

出　　处：《计算机技术与发展》2011年第12期224-226,共3页Computer Technology and Development

基　　金：国家"八六三"重点高技术研究发展计划项目(2009AA062700)

摘　　要：为了实现露天矿坑快速而准确的三维建模,以露天矿坑坡顶线、坡底线、道路边界线以及线上的点作为约束边线和离散点来进行约束Delaunay三角剖分(CDT)建立露天矿坑模型。对于各个离散点,利用KD树进行组织和索引,从而快速地确定各个离散点间的拓扑关系,对CDT后的三角网格进行局部修正,从而使露天矿坑模型更加准确美观。该方法成功在蓝光平台上实现,实验结果表明:利用该方法可以快速、准确地实现露天矿坑的三维建模。总之,这种建模方式更加方便、快捷,有利于离散点的动态增删和离散点与约束边间关系的处理。In order to rapidly and accurately construct a 3D model of an open pit,a constrained Delaunay triangulation（CDT） method is used to construct open pit model. The top lines and bottom lines of pit slope are considered as constrained lines and the points on these lines are considered as discrete points. Use KD-tree to organize and retrieve every discrete point,in order to make sure the topological re- lations of them fast. At the same time,in order to make open mine model more accurately and beautifully,need to modify the triangular mesh locally. This method was realized in blue-ray platform, and the result showed that the method could quickly and accurately realize the 3D modeling of surface mine. In a word,this modeling method is more convenient,and helpful for discrete and add points. On the other hand, this method is using for dealing with the relationship between discrete points and constrained edges.

关 键 词：露天矿 约束DELAUNAY三角剖分 KD树 邻近域 优化 

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