摘要

In this work we study the diameters reduction rate for the iterative application of the longest edge (LE) n-section of triangles for n >= 4. The maximum diameter d(k)(n) of all triangles generated at the kth iteration of the LE n-section is closely connected with the properties of the triangular mesh generated by this refinement scheme. The upper and the lower bounds for d(k)(2) were proved by Kearfott in [9] and for d(k)(3) by Plaza et al. [12]. Here, we derive the two-sided estimates for d(k)(n) with n >= 4.

  • 出版日期2013-11-1