Abstract
We show how to triangulate a polygon without using any obtuse triangles. Such triangulations can be used to discretize partial differential equations in a way that guarantees that the resulting matrix is Stieltjes, a desirable property both for computation and for theoretical analysis.
A simple divide-and-conquer approach would fail because adjacent subproblems cannot be solved independently, but this can be overcome by careful subdivision. Overlay a square grid on the polygon, preferably with the polygon vertices at grid points. Choose boundary cells so they can be triangulated without propagating irregular points to adjacent cells. The remaining interior is rectangular and easily triangulated. Small angles can also be avoided in these constructions.
Article PDF
Similar content being viewed by others
References
I. Babuska and A. K. Aziz, On the angle condition in the finite element method,SIAM J. Numer. Analy. 13 (1976), 214–226.
B. Baker, E. Grosse, and C. Rafferty, Non-obtuse triangulation of polygons, Numerical Analysis Manuscript 84-4, AT&T Bell Laboratories, Murray Hill, NJ, 1985.
R. E. Bank,PLTMG User's Guide, 1985.
R. E. Bank, D. J. Rose, and W. Fichtner, Numerical methods for semiconductor device simulation,IEEE Trans. Electron Devices 30 (1983), 1031–1041.
B. Chazelle and J. Incerpi, Triangulation and shape-complexity, Report CS-83-22, Department of Computer Science, Brown University, 1983.
I. Fried, Condition of finite element matrices generated from nonuniform meshes,AIAA J. 10 (1972), 219–221.
M. R. Garey, D. S. Johnson, F. R. Preparata, and R. E. Tarjan, Triangulating a simple polygon,Inform. Process. Lett. 74 (1978), 4.
J. L. Gerver, The dissection of a polygon into nearly equilateral triangles,Geom. Dedicata 16 (1984), 93–106.
P. J. Green and R. Sibson, Computing Dirichlet tessellations in the plane,Comput. J. 21 (1978), 168–173.
S. E. Laux and B. M. Grossman, A general control-volume formulation for modeling impact ionization in semiconductor transport,IEEE Trans. Electron Devices 32 (1985), 2076–2081.
C. L. Lawson, Generation of a triangular grid with application to contour plotting, Technical Memorandum 299, California Institute of Technology, JPL, 1972.
R. H. MacNeal, An asymmetrical finite difference network,Quart. Appl. Math. 11 (1953), 295–310.
R. R. O'Brienet al., Two-dimensional process modeling,IBM J. Res. Develop. 29 (1985), 229–241.
H. Samet, The quadtree and related hierarchical data structures,ACM Comput. Surveys 16 (1984), 187–260.
M. S. Shephard and M. A. Yerry, An approach to automatic finite element mesh generation,Comput. Engrg 3 (1982), 21–27.
R. Sibson, Locally equiangular triangulations,Comput. J. 21 (1978), 243–245.
G. Strang and G. J. Fix,An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ, 1973.
R. S. Varga,Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
L. O. Wilson, A non-obtuse triangulation which follows a moving interface, Technical Memorandum, AT&T Bell Laboratories, Murray Hill, NJ, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baker, B.S., Grosse, E. & Rafferty, C.S. Nonobtuse triangulation of polygons. Discrete Comput Geom 3, 147–168 (1988). https://doi.org/10.1007/BF02187904
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187904