Linear-Size Nonobtuse Triangulation of Polygons

  title={Linear-Size Nonobtuse Triangulation of Polygons},
  author={Marshall W. Bern and Scott A. Mitchell and Jim Ruppert},
  journal={Discrete & Computational Geometry},
We give an algorithm for triangulating <italic>n</italic>-vertex polygonal regions (with holes) so that no angle in the final triangulation measures more than π/2. The number of triangles in the triangulation is only <italic>O(n)</italic>, improving a previous bound of <italic>O</italic>(<italic>n</italic><supscrpt>2</supscrpt>), and the worst-case running time is <italic>O</italic>(<italic>n</italic>log<supscrpt>2</supscrpt><italic>n</italic>). The basic technique used in the algorithm… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-3 of 3 references

Stable nite elements for problems with wild coe cients

  • S. A. Vavasis
  • Tech. Report TR93- 1364, Dept. of Computer…
  • 1993
Highly Influential
4 Excerpts

On the angle condition in the nite element method

  • I. Babu ska, A. Aziz
  • SIAM J. Numer. Analysis
  • 1976
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…