Bounded flatness of simplexes is crucial for simplicial algorithms to
provide solutions of satisfactory accuracy. By using combinatorial arg
uments we show that iterative Q-refinement with arbitrary mesh of Eucl
idean simplexes, a crucial step in the implementation of simplicial al
gorithms, yields subsimplexes of bounded flatness. The flatness is bou
nded by ([(n + 1)/2])(n/2) . F-n(r), where F-n(r) is the flatness of t
he regular unit n-simplex. (C) Elsevier Science Inc., 1997.