Pit Limit Parameterization From Modified 3d Lerchs-Grossmann Algorithm

A modified 3D Lerchs-Grossmann (LG) graph tree algorithm is presented that generates the complete set of nested maximum valued pits in a single run. 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 aver-age value) branches. The final set of strong branches are 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 how it has been applied at Newmont.