## A lower bound on the angles of triangles constructed by bisecting the longest side

HTML articles powered by AMS MathViewer

- by Ivo G. Rosenberg and Frank Stenger PDF
- Math. Comp.
**29**(1975), 390-395 Request permission

## Abstract:

Let $\Delta {A^1}{A^2}{A^3}$ be a triangle with vertices at ${A^1},{A^2}$ and ${A^3}$. The process of "bisecting $\Delta {A^1}{A^2}{A^3}$" is defined as follows. We first locate the longest edge, ${A^i}{A^{i + 1}}$ of $\Delta {A^1}{A^2}{A^3}$ where ${A^{i + 3}} = {A^i}$, set $D = ({A^i} + {A^{i + 1}})/2$, and then define two new triangles, $\Delta {A^i}D{A^{i + 2}}$ and $\Delta D{A^{i + 1}}{A^{i + 2}}$. Let ${\Delta _{00}}$ be a given triangle, with smallest interior angle $\alpha > 0$. Bisect ${\Delta _{00}}$ into two new triangles, ${\Delta _{1i}},i = 1,2$. Next, bisect each triangle ${\Delta _{1i}}$, to form four new triangles ${\Delta _{2i}},i = 1,2,3,4$, and so on, to form an infinite sequence*T*of triangles. It is shown that if $\Delta \in T$, and $\theta$ is any interior angle of $\Delta$, then $\theta \geqslant \alpha /2$.

## References

- Miloš Zlámal,
*On some finite element procedures for solving second order boundary value problems*, Numer. Math.**14**(1969/70), 42–48. MR**256588**, DOI 10.1007/BF02165098 - Charles Harvey and Frank Stenger,
*A two-dimensional analogue to the method of bisections for solving nonlinear equations*, Quart. Appl. Math.**33**(1975/76), no. 4, 351–368. MR**455361**, DOI 10.1090/S0033-569X-1976-0455361-7
J. F. RANDOLPH,

*Calculus and Analytic Geometry*, Wadsworth, Belmont, Calif., 1961.

## Additional Information

- © Copyright 1975 American Mathematical Society
- Journal: Math. Comp.
**29**(1975), 390-395 - MSC: Primary 50B15; Secondary 65M10
- DOI: https://doi.org/10.1090/S0025-5718-1975-0375068-5
- MathSciNet review: 0375068