Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

A new rock slicing method based on linear programming

Tools
- Tools
+ Tools

Boon, Chia Weng, Houlsby, G. T. and Utili, Stefano (2015) A new rock slicing method based on linear programming. Computers and geotechnics, 65 . pp. 12-29. doi:10.1016/j.compgeo.2014.11.007 ISSN 0266-352X.

[img]
Preview
PDF
WRAP_A new rock slicing method based on linear programming_post-print.pdf - Accepted Version - Requires a PDF viewer.

Download (3902Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.compgeo.2014.11.007

Request Changes to record.

Abstract

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.

Item Type: Journal Article
Subjects: T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Science, Engineering and Medicine > Engineering > Engineering
Library of Congress Subject Headings (LCSH): Block theory (Rock mechanics), Linear programming, Discrete element method
Journal or Publication Title: Computers and geotechnics
Publisher: Elsevier BV
ISSN: 0266-352X
Official Date: April 2015
Dates:
DateEvent
April 2015Published
12 December 2014Available
13 November 2014Accepted
5 June 2014Submitted
Volume: 65
Number of Pages: 17
Page Range: pp. 12-29
DOI: 10.1016/j.compgeo.2014.11.007
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 30 December 2015
Date of first compliant Open Access: 30 December 2015

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us