We show that a certain dissection policy for n-simplices based on barycentric subdivision comes within a constant factor, independent of n, of the optimal rate of decrease in diameter. This result is of interest in constructing good triangulations for the homotopy algorithms that approximately compute fixed points.
['Michael J. Todd', 'Robert C. Acar']
A Note on Optimally Dissecting Simplices