✦ LIBER ✦

Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions

✍ Scribed by Zhou, Yunhong; Suri, Subhash

Book ID: 118180492
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 229 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539799363992

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Streaming and dynamic algorithms for min

Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

✍ Chan, Timothy M.; Pathak, Vinayak 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 242 KB

An algorithm for the Rectilinear Minimum

An algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions

✍ David P. Wagner; Robert Scot Drysdale; Clifford Stein 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of

A spectrally accurate algorithm for elec

A spectrally accurate algorithm for electromagnetic scattering in three dimensions

✍ M. Ganesh; S. C. Hawkins 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 990 KB

A domain decomposition algorithm for ell

A domain decomposition algorithm for elliptic problems in three dimensions

✍ Barry F. Smith 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 689 KB