A Note on Optimally Dissecting Simplices
本文证明了一种基于重心剖分的n维单形剖分策略，其直径递减速率与最优速率相差不超过一个与n无关的常数因子，这对构造用于近似计算不动点的同伦算法中的优质三角剖分有参考价值。
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.