A new rock slicing method based on linear programming

One of the important pre-processing stages in the analysis of jointed rock masses is the identification of rock blocks from discontinuities in the field. In 3D, the identification of polyhedral blocks usually involve tedious housekeeping algorithms, because one needs to establish their vertices, edges and faces, together with a hierarchical data structure: edges by pairs of vertices, faces by bounding edges, polyhedron by bounding faces. In this paper, we present a novel rock slicing method, based on the subdivision approach and linear programming optimisation, which requires only a single level of data structure rather than the current 2 or 3 levels presented in the literature. This method exploits the novel mathematical framework for contact detection introduced in Boon et al. (2012). In the proposed method, it is not necessary to calculate the intersections between a discontinuity and the block faces, because information on the block vertices and edges is not needed. The use of a simpler data structure presents obvious advantages in terms of code development, robustness and ease of maintenance. Non-persistent joints are also introduced in a novel way within the framework of linear programming. Advantages and disadvantages of the proposed modelling of non-persistent joints are discussed in this paper. Concave blocks are generated using established methods in the sequential subdivision approach, i.e. through fictitious joints. (C) 2014 Elsevier Ltd. All rights reserved.