✦ LIBER ✦

Generating random polygons with given vertices

✍ Scribed by Chong Zhu; Gopalakrishnan Sundaram; Jack Snoeyink; Joseph S.B. Mitchell

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 803 KB
Volume: 6
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00031-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Largest polygons with vertices in a give

Largest polygons with vertices in a given finite set

✍ Craig Cordes; K.B. Reid 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Vertices of given degree in a random gra

Vertices of given degree in a random graph

✍ Béla Bollobás 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

Shape measures for random triangles with

Shape measures for random triangles with vertices I.I.D.-uniform in convex polygons

✍ Huiling Le 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

Graphs with given neighborhoods of verti

Graphs with given neighborhoods of vertices

✍ S. Ya. Agakishieva 📂 Article 📅 1968 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 199 KB

Self-inscribed polygons with vertices on

Self-inscribed polygons with vertices on nonsingular cubic curves

✍ N.S. Mendelsohn; R. Padmanabhan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 444 KB

On the number of vertices of given degre

On the number of vertices of given degree in a random graph

✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor