检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谭正华[1,2] 王李管[2] 熊书敏[2] 刘任任[1]
机构地区:[1]湘潭大学湖南省高等学校智能制造重点实验室,湖南湘潭411105 [2]中南大学数字矿山研究中心,湖南长沙410083
出 处:《中南大学学报(自然科学版)》2012年第2期626-631,共6页Journal of Central South University:Science and Technology
基 金:国家自然科学基金资助项目(61070232);湘潭大学校级资助项目(11QDZ11)
摘 要:根据实测边界线和断面参数,提出地下巷道三维实体的分层建模解决方案:采用图论的树结构表达边界线划分的复杂区域(简称区域树),并采用约束三角剖分的方法对区域网格三角化;提取所有三角形中表示巷道的断面底边和"出口位置"的边,根据断面参数,拟合生成断面轮廓线;均匀离散化断面轮廓线,生成左右对称点列,这些点构成三维巷道实体的特征点;分层提取断面轮廓线上的特征点,生成分层轮廓线;最后对相邻分层轮廓线和顶、底轮廓线分别实现巷道体网格三角化。研究结果表明:该算法充分利用区域树表达的空间拓扑关系和断面参数信息,实现简单,适用于同一中段边界线在任意复杂情况下的连通巷道实体三维建模。A hierarchical modeling method for measured laneway entities based on boundary lines and cross section was proposed.The basic idea of the method was described as follows.Spatial organization of regions(containing holes) generated by boundary lines was represented using tree structure.Surface described by triangles was generated by regions using constrained triangulation method.The sides expressed the export location in triangulations and the bottom of section were picked up.Cross section contours were generated according to section parameter.Symmetrical points were generated by sections constituted laneway entity feature points.The cross-section data were obtained,and a series of hierarchical contours were built,which composed the hierarchical contours of the laneway entity.Finally,triangular girds of laneway were generated by 3D objects reconstruction of adjacent contours and triangulation of both roof contour and bottom contours.The results show that the topology of region and section parameter can be used to reduce calculation burden and simplify the implementation.
关 键 词:边界线 区域树 约束三角剖分 分层建模 实测巷道
分 类 号:TD672[矿业工程—矿山机电] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222