✦ LIBER ✦

Computing the three-dimensional convex hull

✍ Scribed by D.C.S. Allison; M.T. Noga

Book ID: 108314549
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 774 KB
Volume: 103
Category: Article
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(97)00027-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust gift wrapping for the three-dimen

Robust gift wrapping for the three-dimensional convex hull

✍ Kokichi Sugihara 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A conventional gift-wrapping algorithm for constructing the three-dimensional convex hull is revised into a numerically robust one. The proposed algorithm places the highest priority on the topological condition that the boundary of the convex hull should be isomorphic to a sphere, and uses numerica

Computing the convex hull of line inters

Computing the convex hull of line intersections

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

Computing the convex hull in a hammock

✍ Y.L. Wang; R.C.T. Lee; J.S. Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 794 KB

Computing the convex hull of a simple po

Computing the convex hull of a simple polygon

✍ Chern-Lin Chen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 337 KB

A time-optimal parallel algorithm for th

A time-optimal parallel algorithm for three-dimensional convex hulls

✍ N. M. Amato; F. P. Preparata 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 937 KB

Computable representations for convex hu

Computable representations for convex hulls of low-dimensional quadratic forms

✍ Kurt M. Anstreicher; Samuel Burer 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 252 KB