𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acute Triangulations of Polygons

✍ Scribed by H. Maehara


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
122 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


We prove that every n-gon can be triangulated into O(n) acute triangles. We also present a short proof of the result that every polygon can be triangulated into right triangles.


πŸ“œ SIMILAR VOLUMES


Flips SignΓ©s et Triangulations d’un Poly
✍ Sylvain Gravier; Charles Payan πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 169 KB

In this paper, we prove that any two triangulations of a given polygon may be transformed into one another by a signable sequence of flips if and only if every planar graph is 4-colorable. This result prove a conjecture due to Eliahou. Dans ce papier, on montre que l'on peut passer de toute triangu

Isotopy of Polygonal Domains for General
✍ M. Joswig πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 163 KB

We examine the relationship between collineations of generalized polygons and certain 'symmetries' of their coordinating structures.

Algebraic Polygons
✍ Linus Kramer; Katrin Tent πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 178 KB

In this paper we prove the following: Over each algebraically closed field K of Ε½ . characteristic 0 there exist precisely three algebraic polygons up to duality , namely the projective plane, the symplectic quadrangle, and the split Cayley Ε½ . hexagon over K Theorem 3.3 . As a corollary we prove th

Prism-hamiltonicity of triangulations
✍ Daniel P. Biebighauser; M. N. Ellingham πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 226 KB

## Abstract The __prism__ over a graph __G__ is the Cartesian product __G__ ░ __K__~2~ of __G__ with the complete graph __K__~2~. If the prism over __G__ is hamiltonian, we say that __G__ is __prism‐hamiltonian__. We prove that triangulations of the plane, projective plane, torus, and Klein bottle

Expansion of Centered Triangulations
✍ D. Benard; J.L. Fouquet πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 370 KB

We use a construction of A. Bouchet for covering triangulations by means of nowhere-zero dual flows, but slightly modified, to prove that whenever \(G\) is a simple graph, which is not a star, two-cell embedded in a surface \(S\), and \(m\) is a nonnegative integer not divisible by 2,3 , or 5 , ther

Irreducible Triangulations of Surfaces
✍ Z. Gao; R.B. Richter; P.D. Seymour πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 346 KB

In this note we show that, for any surface 7 and any k, there are at most finitely many triangulations of 7 such that each edge is in a noncontractible cycle of length k and is in no shorter noncontractible cycle. Such a triangulation is k-irreducible. This is equivalent to the statement that for an