Investigate using an insertion algorithm to build the database quality tiers

[nfrechette]

Right now the algorithm that builds the database quality tiers removes the key frames with the lowest error one by one until only the boundary key frames remain. Instead, we could start with the boundary key frames and add the key frame that lowers the error the most.

Can this improve the quality for a specific target memory footprint?