𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note – On the Number of Triangulations of Planar Point Sets

✍ Scribed by Raimund Seidel

Publisher
Springer-Verlag
Year
1998
Tongue
English
Weight
110 KB
Volume
18
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Fair Triangulations
On the Number of Fair Triangulations
✍ Han Ren; Yanpeu Liu 📂 Article 📅 2000 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 211 KB
On the number of Hamiltonian cycles in t
On the number of Hamiltonian cycles in triangulations
✍ Jan Kratochvil; Dainis Zeps 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

It is proved that if a planar triangulation different from K3 and K4 contains a Hamiltonian cycle, then it contains at least four of them. Together with the result of Hakimi, Schmeichel, and Thomassen [21, this yields that, for n 2 12, the minimum number of Hamiltonian cycles in a Hamiltonian planar

Computing the shape of a planar points s
Computing the shape of a planar points set
✍ Mahmoud Melkemi; Mourad Djebali 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In this article, we introduce a mathematical formalism de"ning the shape of a "nite point set which we call A-shape. The parameter A is a "nite set of points which positions variation allows A-shape to generate a family of graphs extracted from Delaunay triangulation. Each graph corresponds to an el

The santalo point of a planar convex set
The santalo point of a planar convex set
✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)