As an update to the last post on drill compositing, I’ve implemented a limited set of algorithms for the hard boundary compositing of drill hole intervals. It is important to note that the hard boundary aggregation algorithms must honor the smaller intervals in the drill hole. All of the implementations I have seen utilise a version of what I have implemented as the greedy method. One of the issues I have with the greedy algorithm is that there is no guarantee that the solution for a given drill hole is closest to the optimum i.