期刊文献+

实体建模三角网相交算法及应用研究 被引量:1

SPACE TRIANGULATED IRREGULAR NETWORK INTERSECTION ALGORITHM
下载PDF
导出
摘要 通过构建不规则三角网模型的方法,采取包围盒方法排除两三角网模型中大量无效三角形单元,辅以空间编码技术进一步定位相交三角形集合,即利用AUTOCAD软件下的VBA语言实现初期网格模型构建和最终交线生成;中期数据处理采用VC++编译环境,对其进行相交检测并求出交线端点坐标,经过端点排序最终生成连续的多段线或闭合交线环形成包络面,此举能够极大地降低计算过程的实体建模和运算的大量数据而导致的计算效率低,最终准为实现露天矿生产过程中数字化模拟。 The methods and processes were explored to build triangulated irregular network models which adopt the bounding box approach to exclude the large number of invalid triangular elements in the two triangular network models,supplements by space coding technology is further positioned to intersect the triangle collection.The endpoint was sorted to result continuous polyline or closed cross-wire loops.Through VBA language under the autoCAD software,the initial grid model and the cross-line were eventually achieved to generate medium-term data processing under VC + + compiler environment.In order to achieve efficient data processing,the open pit construction and production process design digital simulation were achieved conveniently.
作者 王喜贤
出处 《中国钼业》 2013年第6期15-17,共3页 China Molybdenum Industry
关键词 不规则三角网 包围盒 VBA语言 露天矿 数字化模拟 triangular irregular network bounding box VBA language open pit mine digital simulation
  • 相关文献

参考文献10

  • 1Brassel K E,Reif D. Procedure to generathissen polygons[J].{H}GEOGRAPHICAL ANALYSIS,1979.289-303.
  • 2Mc Cullagh M J,Ross C G T. Delaunay triangulation of a random data set for is arithmic mapping[J].The Cartograohic Journal,1980.93-99.
  • 3张少丽,王毅刚,边浩.一种提高三角网格模型求交效率的算法[J].计算机工程,2010,36(17):213-215. 被引量:4
  • 4张少丽,王毅刚,陈小雕.基于空间分解的三角网格模型求交方法[J].计算机应用,2009,29(10):2671-2673. 被引量:13
  • 5Tomas Moller. A fast triangle-triangle intersection test[J].{H}Journal of Graphices Tools,1997,(02):25-30.
  • 6Lee D T,Schacher. Two algorithms for constructinga Delaunaytriangulation[J].{H}International Journal of Computer and Information Sciences,1980,(09):219-242.
  • 7Johnstone J K,Sloan K R. Tensor product surfaces guided by minimal surface areaTriangulations[A].1995.354-361.
  • 8Macedonio G,Pareschi MT. An algorithm for the triangulation of arbitrarily distributed points:applications to volume estimate and terrain fitting[J].Computers& Geosciences,1991.859-874.
  • 9Brassel K E,Reif D. Procedure to generate thissen polygons[J].{H}GEOGRAPHICAL ANALYSIS,1979.289-303.
  • 10Mc Cullagh M J,Ross C G T. Delaunay triangulation of a random data set for is arithmic mapping[J].The Cartographic Journal,1980.93-99.

二级参考文献13

共引文献14

同被引文献7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部