On a proper acute triangulation of a polyhedral surface (Q2275447)

From MaRDI portal





scientific article; zbMATH DE number 5937067
Language Label Description Also known as
default for all languages
No label defined
    English
    On a proper acute triangulation of a polyhedral surface
    scientific article; zbMATH DE number 5937067

      Statements

      On a proper acute triangulation of a polyhedral surface (English)
      0 references
      0 references
      9 August 2011
      0 references
      Acute triangulations traditionally draw attention of mathematicians. It is already known that: 1) Every \(n\)-gon can be triangulated into \(O(n)\) acute triangles [the author, Eur. J. Comb. 23, No. 1, 45--55 (2002; Zbl 1006.65019); \textit{L. Yuan}, Discrete Comput. Geom. 34, No. 4, 697--706 (2005; Zbl 1112.52002)]. 2) A regular icosahedron can be triangulated into 12 acute triangles [\textit{J.-i. Itoh} and \textit{T. Zamfirescu}, Discrete Comput. Geom. 31, No. 2, 197--206 (2004; Zbl 1062.51014)]. 3) A regular dodecahedron can be triangulated into 14 acute triangles [\textit{J.-i. Itoh} and \textit{T. Zamfirescu}, Eur. J. Comb. 28, No. 4, 1072--1086 (2007; Zbl 1115.52004)]. Other facts are reviewed in [\textit{T. Zamfirescu}, ``Acute triangulations: a short survey'', in: Proceedings 6th annual conference Romanian Soc. Math. Sciences I. 9--17 (2002)]. Let \(\Sigma\) be a polyhedral surface in \(\mathbb R^3\) with \(n\) edges. Let \(L\) be the length of the longest edge, \(\delta\) be the minimum value of the geodesic distance from a vertex to an edge that is not incident to the vertex, and \(\theta\) be the measure of the smallest face angle in \(\Sigma\). In the present paper it is proven that \(\Sigma\) can be triangulated into at most \(CLn/(\delta \theta)\) planar and rectilinear acute triangles, where \(C\) is an absolute constant.
      0 references
      polyhedral surface
      0 references
      acute triangulation
      0 references
      proper triangulation
      0 references

      Identifiers