✦ LIBER ✦

The complex of non-crossing diagonals of a polygon

✍ Scribed by Benjamin Braun; Richard Ehrenborg

Book ID: 108167309
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 207 KB
Volume: 117
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.03.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the products of cross-ratios on diago

On the products of cross-ratios on diagonals of polygons

✍ Joseph Zaks 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 259 KB

The purpose of this paper is to establish a conjecture of B. Griinbaum, which states that in every n-polygon P in the plane, n > 5, some diagonals intersect in a pattern that defines a new n-polygon 6 (P), such that the product of the cross-ratios on the diagonals of P is equal to the product of the

The Number of Intersection Points Made b

The Number of Intersection Points Made by the Diagonals of a Regular Polygon

✍ Poonen, Bjorn; Rubinstein, Michael 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 375 KB

Computing the longest diagonal of a simp

Computing the longest diagonal of a simple polygon

✍ Alok Aggarwal; Subhash Suri 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Computing the shortest diagonal of a mon

Computing the shortest diagonal of a monotone polygon in linear time

✍ Binhai Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Finding a shortest diagonal of a simple

Finding a shortest diagonal of a simple polygon in linear time

✍ John Hershberger; Subhash Suri 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 792 KB

Spontaneous magnetization of the Ising m

Spontaneous magnetization of the Ising model on a square lattice with non-crossing diagonal interactions

✍ K.Y. Lin; S.F. Lee 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 135 KB