The core of our algorithm is loop which iterates through the elements while the current tetrahedral count is greater than the target tetrahedral count. A subset of the elements is selected and reordered. Then, one at a time, we look for a transformation to improve or remove each element in the list.