✦ LIBER ✦

Test for intersection between a plane and a connected compact polyhedron

✍ Scribed by Ching-Kuang Shene

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 343 KB
Volume: 26
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(94)90090-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A composite branch and bound, cutting pl

A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron

✍ Kurt M. Bretthauer; A.Victor Cabot 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Finding the connected components and a m

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

✍ Hiroshi Imai; Takao Asano 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 732 KB

A compact algorithm for the intersection

A compact algorithm for the intersection and approximation of N-dimensional polytopes

✍ V. Broman; M.J. Shensa 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 885 KB

In a very general sense, estimation problems are concerned with relating measurements to a (hopefully small) region containing the unknown state or parameters. Polytopes present a natural candidate for the representation and manipulation of such regions. In fact, assuming the existence of a suitable

A compact plane crystal spectrometer for

A compact plane crystal spectrometer for the energy range between 500 eV and 5000 eV

✍ Erich Tegeler 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 232 KB

A fast triangle to triangle intersection

A fast triangle to triangle intersection test for collision detection

✍ Oren Tropp; Ayellet Tal; Ilan Shimshoni 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

A connection between alternating sign ma

A connection between alternating sign matrices and totally symmetric self-complementary plane partitions

✍ William F Doran IV 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 779 KB