一种网格拓扑关系的三角网切割算法  

A triangular mesh cutting algorithm for grid topology

作　　者：黄明 王玥 王成 HUANG Ming;WANG Yue;WANG Cheng(School of Mapping and Urban Spatial Information,Beijing University of Civil Engineering and Architecture,Beijing 102616,China;Beijing Key laboratory for Architectural Heritage Fine Reconstruction&Health Monitoring,Beijing 102616,China;Engincering ResearchCenter of lypical Architecture and Ancient Architecture Database,MOE,Beijing 102616 ,China)

机构地区：[1]北京建筑大学测绘与城市空间信息学院,北京102616 [2]建筑遗产精细重构与健康监测北京市重点实验室,北京102616 [3]代表性建筑与古建筑数据库教育部工程研究中心,北京102616

出　　处：《测绘科学》2019年第3期39-46,共8页Science of Surveying and Mapping

基　　金：十三五国家重点研发计划项目(2016YFC0802107);北京市教育委员会科技计划一般项目(2016子项目49);国家自然科学基金项目(41501494;41601409);北京市自然科学基金项目(8172016);北京市科委2017年度创新基地培育与发展专项(Z171100002217075)

摘　　要：针对目前的三角网切割效率不高的问题,该文提出了一种网格拓扑关系搜索的三角网模型切割方法。利用三角网模型中三角形的索引和顶点索引,构建边的索引,从而构建点索引、边索引和三角形索引之间的拓扑关系,最终形成三维模型的"边-顶点-邻接三角形的拓扑关系"。根据当前屏幕范围,提取三维视景体内的三角形,利用GPU并行运算,快速获取离视点最近的三角形索引,从而获取到所有三角网中的第一层三角网,并根据拓扑关系提取边界三角形,再利用基于边的约束对边界三角形进行重新剖分。实验结果表明,该方法可以快速准确地完成离视点最近的三角网模型表面的切割。To the problem of a triangulnr mesh model culling cfficiency, a triangular mesh model cutting method for grid topology search was proposed In this paper. By using the index and vertex index of triangles, the index of the edge was construclcd and the topological relationship between the point index, edge index and triangle index was constructed,and the"edge vertex-adjacency triangle topology" of the 3D model was finally formed .According to the current screen range, the triangle in the 3D scene was extracted ,and the GPU parallel operation was used to quickly obtain the nearest triangle index from the view point ,thus obtaining the first triangulation net in all the triangulation networks,extracting tlic boundary triangle according to the topological relation. and reconstructing the boundary triangle by the edge based constraint. Experimental results showed that the method could quickly and accurately cut the surface of the nearest triangulation model.

关 键 词：三角网 切割 拓扑关系 约束边 

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