✦ LIBER ✦

An Efficient Algorithm for the Regular W1Packing of Polygons in the Infinite Plane

✍ Scribed by P. D. Watson and A. M. Tobias

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Euclidean Sho

✍ S. Kapoor; S. N. Maheshwari; J. S. B. Mitchell 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 126 KB

Extremal properties of the principal Dir

✍ L. Karp; N. Peyerimhoff 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 140 KB

An algorithm to determine the directiona

✍ Donna J. Peuquet; Zhan Ci-Xiang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Efficient generation of simple polygons

✍ Matt Duckham; Lars Kulik; Mike Worboys; Antony Galton 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 793 KB

An efficient algorithm for the computati

✍ Evgeny Lipovetsky; Nira Dyn 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 279 KB

The scattering of particles in an infini

✍ P. J. Brockwell 📂 Article 📅 1964 🏛 Società Italiana di Fisica ⚖ 749 KB