The dissection of a polygon into nearly equilateral triangles
Every polygon can be dissected into acute triangles. In this paper it is proved that every polygon, such that all interior angles are at least \(\pi/5\), can be dissected into triangles with interior angles all less than or equal to \(2\pi/5\). Necessary conditions are found on the interior angles of the polygon in order to obtain a dissection into triangles with interior angles all \(\leq\alpha\) (where \(\pi/3< \alpha< 2\pi/5),\) and the conjecture is stated that these conditions are also sufficient. These results are proved first for regular polygons, using Euler's formula, and extended to irregular polygons via the Riemann mapping theorem.
- Dissections of polygons into triangles of equal areas
- Dissections of regular polygons into triangles of equal areas
- Dissections of regular polygons into similar triangles
- Dissections into equilateral triangles
- Triangle dissections of convex polygons
- Dissection of a triangle into similar triangles
- Triangular Dissections of N-Gons
- Dissections of quadrilaterals into triangles of equal areas
- An enumeration of equilateral triangle dissections
- Nonobtuse triangulation of polygons
- Dissections of regular polygons into triangles of equal areas
- Tiling space and slabs with acute tetrahedra.
- Discrete comparison principles for quasilinear elliptic PDE
- A matrix analysis approach to discrete comparison principles for nonmonotone PDE
- Triangulating a convex polygon with fewer number of non-standard bars
- Nonobtuse triangulations of PSLGs
- A conservative unstructured scheme for rapidly varied flows
- scientific article; zbMATH DE number 4026235 (Why is no real title available?)
- Balanced triangulations
- scientific article; zbMATH DE number 515326 (Why is no real title available?)
- Cutting Polyominos into Equal-Area Triangles
- scientific article; zbMATH DE number 2058624 (Why is no real title available?)
- scientific article; zbMATH DE number 1445692 (Why is no real title available?)
- Exploring dissections of rectangles into right-angled triangles
- Acute triangulations of polygons
- Optimal angle bounds for quadrilateral meshes
- Uniformly acute triangulations of polygons
- Optimal triangulation of polygons
- Global and local refinement techniques yielding nonobtuse tetrahedral partitions
- Acute triangulations of the regular dodecahedral surface
This page was built for publication: The dissection of a polygon into nearly equilateral triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798665)
