Pit-Limit Parameterization From Modified Three-Dimensional Lerches-Grossmann Algorithm

A modified three-dimensional Lerches-Grossmann (LG) graph tree algorithm that generates the complete set of nested maximum valued pits in a single run is presented. This modified LG algorithm looks at the relative strength (average value) of the branches (groups of blocks). Pointers are allocated and pruned until there are no members of weaker (lower average value) branches overlying members of stronger (higher average value) branches. The final set of strong branches arc listed in order of decreasing strength. The pits they represent form the maximum valued convex hull for a single-variable pit-limit parameterization. A description of the algorithm is given along with examples of lion it has been applied at Newmont.