欢迎访问中国科学院大学学报,今天是
环境科学与地理学

基于空间索引的随机分布三维裂隙网络中裂隙对相交判断方法

  • 刘华梅 ,
  • 王明玉 ,
  • 宋现锋
展开
  • 中国科学院研究生院资源与环境学院及水系统安全研究中心, 北京 100049

收稿日期: 2011-05-09

  修回日期: 2012-04-17

  网络出版日期: 2013-01-15

Stepwise approach for identifying pairwise fracture intersections in 3D fracture networks

  • LIU Hua-Mei ,
  • WANG Ming-Yu ,
  • SONG Xian-Feng
Expand
  • Center for Water System Security & College of Resources and Environment, Graduate University, Chinese Academy of Sciences, Beijing 100049, China

Received date: 2011-05-09

  Revised date: 2012-04-17

  Online published: 2013-01-15

Supported by

Supported by National Science Foundation of China (40672172,40972166),Major State Basic Research Development Program of China (973 Program) (2010CB428804), the Major Science and Technology Program for Water Pollution Control and Treatment(2009ZX07212-003),and the Major Science and Technology Program of Beijing (D09040903700801)

摘要

明确裂隙间的相交关系,去除那些对流体流动与溶质运移无贡献的、与其他裂隙不联通的裂隙,能够大大提高裂隙中流体流动和溶质运移数值模拟的效率.提出一种基于空间索引的随机分布三维裂隙网络中裂隙对逐步相交判断的方法.通过数值模拟试验比较了该方法与传统的穷举法,结果表明,该方法速度快、成本低,大大减少了裂隙岩体渗流计算量,缩短了裂隙岩体流体渗流和溶质运移数值模拟计算时间.

本文引用格式

刘华梅 , 王明玉 , 宋现锋 . 基于空间索引的随机分布三维裂隙网络中裂隙对相交判断方法[J]. 中国科学院大学学报, 2013 , 30(1) : 24 -32 . DOI: 10.7523/j.issn.1002-1175.2013.01.005

Abstract

Numerical computation for flow and solute transport in fractured rocks will be very efficient if only the connected fractures are kept. An approach is proposed for progressively identifying pairwise fracture intersections in 3D stochastically distributed fracture networks based on spatial indexing. By comparing the simulation results obtained using the proposed stepwise approach and the traditional exhaustion algorithm, we observed that, the proposed approach is much more effective.

参考文献

[1] Stauffer D. Introduction to percolation theory[M]. London: Taylor and Francis,1985.

[2] Wang E Z, Yang C T. Numerical model of groundwater flow in fracture networks and water flow in disconnected fracture networks[J]. Hydrogeology and Engineering geology, 1992,19(1):12-14(in Chinese). 王恩志,杨成田.裂隙网络地下水流数值模型及非连通裂隙网络水流的研究[J].水文地质工程地质,1992,19(1):12-14.

[3] Yu Q C, Huang X X. Discrete fracture network flow modeling[J]. Hydrogeology and Engineering geology 1992,3:20-24(in Chinese). 于青春,黄喜新. 非连续裂隙网络水流计算机模拟[J].水文地质工程地质,1992(3):20-24.

[4] Lu B, Chen J P, Wang L K. Automatic seeking for complex finite rock block and judgment of its spatial geometrical shape based on 3D network modeling[J]. Chinese Journal of Rock Mechanics and Engineering, 2002,21(8): 1232-1238(in Chinese). 卢波,陈剑平,王良奎. 基于三维网络模拟基础的复杂有限块体的自动搜索及其空间几何形态的判定[J]. 岩石力学与工程学报,2002,21(8):1232-1238.

[5] Yu Q C,Wu X, Ohnishi Yuzo. Channel model for fluid flow in discrete fracture network and its modification[J]. Chinese Journal of Rock Mechanics and Engineering, 2006,25(7): 1469-1474(in Chinese). 于青春,武雄,Ohnishi Yuzo. 非连续裂隙网络管状渗流模型及其校正[J]. 岩石力学与工程学报,2006, 25(7): 1469-1474.

[6] Zhao H L, Chen J P. Searching for seepage path of 3D network in fractured rock masses[J]. Chinese Journal of Rock Mechanics and Engineering,2005,24(4): 622-627(in Chinese). 赵红亮,陈剑平. 裂隙岩体三维网络流的渗透路径搜索[J]. 岩石力学与工程学报,2005,24(4): 622-627.

[7] Liu H M, Wang M Y. Algorithms and their optimization for identification of the connected flow paths for 3D fracture networks in fractured rocks[J]. Journal of the Graduate School of the Chinese Academy of Sciences, 2010, 27(4):463-470(in Chinese). 刘华梅,王明玉.三维裂隙网络渗流路径识别算法及其优化[J].中国科学院研究生院学报,2010,27(4):463-470.

[8] Long J C S, Gilmour P, Witherspoon P A. A mod elfor steadyfluid flow in random three-dimensional networks of disc-shaped fractures[J]. Water Resour Res, 1985, 21(8):1105-1115.

[9] Assarsson U, Moller T. Optimized view frustum culling algorithms for bounding boxes[J]. Journal of Graphics Tools, 2000, 5(1):9-22.

[10] Yamada A, Yamaguchi F. Homogeneous bounding boxes as tools for intersection algorithms of rational bezier curves and surfaces[J].Visual Computer, 1996,12(4): 202-214.

[11] Sanna A, Montuschi P. On the computation of groups of bounding boxes for fast test of objects intersection[C]//IEEE 14th Annual International Phoenix Conference on Computers and Communications. SCOTTSDALE AZ, 1995: 684-690.

[12] Guttman A. R-trees: a dynamic index structure for spatial searching[C]//Proceeding of ACM SIGMOD. Boston: ACM Press, 1984, 14(2):45-75.

[13] Bertinoe E, Doi B C, Sacks-Davis R, et al. Indexing techniques for advanced database systems[M]. Boston: Kluwer Academic Publishers, 1997.

[14] du Mouza C, Litwin W, Rigaux P. Large-scale indexing of spatial data in distributed repositories: the SD-Rtree[J]. VLDB Journal, 2009, 18(4): 933-958.

文章导航

/