✦ LIBER ✦

On the number of rectangulations of a planar point set

✍ Scribed by Eyal Ackerman; Gill Barequet; Ron Y. Pinter

Book ID: 118475160
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 227 KB
Volume: 113
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.10.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of extreme triples of a plana

The number of extreme triples of a planar point set

✍ E. A. Ramos 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 842 KB

Note – On the Number of Triangulations o

Note – On the Number of Triangulations of Planar Point Sets

✍ Raimund Seidel 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 110 KB

Planar point sets with a small number of

Planar point sets with a small number of empty convex polygons

✍ Bárány, Imre; Valtr, Pável 📂 Article 📅 2004 🏛 Akadmiai Kiad 🌐 Hungarian ⚖ 303 KB

On pseudo-convex partitions of a planar

On pseudo-convex partitions of a planar point set

✍ Bhattacharya, Bhaswar B.; Das, Sandip 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 542 KB

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)

The Polytope of Non-Crossing Graphs on a

The Polytope of Non-Crossing Graphs on a Planar Point Set

✍ David Orden; Francisco Santos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 355 KB