2015
DOI: 10.1016/j.compgeo.2014.11.007
|View full text |Cite
|
Sign up to set email alerts
|

A new rock slicing method based on linear programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
27
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 30 publications
(27 citation statements)
references
References 40 publications
0
27
0
Order By: Relevance
“…The linear programming optimization approach introduced by Boon et al greatly simplifies how block cutting is implemented and how each block is represented in terms of data structure. We give only a brief overview of this rock cutting algorithm since the details are presented in [9].…”
Section: Block Cutting Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…The linear programming optimization approach introduced by Boon et al greatly simplifies how block cutting is implemented and how each block is represented in terms of data structure. We give only a brief overview of this rock cutting algorithm since the details are presented in [9].…”
Section: Block Cutting Algorithmmentioning
confidence: 99%
“…Additionally, we take advantage of two major optimizations to the block cutting process that are presented in [9]. The first optimization draws on an idea common to contact detection in particle methods (for example, see [12]): the complex geometry of the polyhedral blocks is enclosed in a simpler shape, in this case a bounding sphere.…”
Section: Block Cutting Algorithmmentioning
confidence: 99%
See 3 more Smart Citations