Robust algorithms for polyhedral modelling of fractured rock mass structure

This paper presents robust algorithms for application in polyhedral modelling of rock mass structure based on discrete fracture networks. The algorithms improve the robustness of current polyhedral modellers to challenging or degenerate geometries and geometrical errors. These issues are inevitably encountered when the fracture network realisations incorporate large numbers of fractures, or regions of densely packed fractures are modelled, or when the number of fracture network realisations interrogated is large. Several stages in the polyhedral modelling process which are sensitive to geometrical errors are reviewed and algorithms which are robust and capable of handling topological errors in the input fracture network geometry are presented.