✦ LIBER ✦

Computing the intersection-depth of polyhedra

✍ Scribed by David Dobkin; John Hershberger; David Kirkpatrick; Subhash Suri

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Newton polyhedra and the genus of comple

✍ A. G. Khovanskii 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 733 KB

Space sweep solves intersection of conve

✍ Stefan Hertel; Martti Mäntylä; Kurt Mehlhorn; Jurg Nievergelt 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 949 KB

Intersecting all edges of centrally symm

✍ Branko Grünbaum 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Improved integer programming bounds usin

✍ David E. Bell; Marshall L. Fisher 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 978 KB

Computing the convex hull of line inters

✍ Mikhail J Atallah 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A new O(n·log n) algorithm for computing

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB