✦ LIBER ✦

Approximation algorithms for cutting a convex polyhedron out of a sphere

✍ Scribed by Tan, Xuehou; Wu, Gangshan

Book ID: 121369219
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 399 KB
Volume: 508
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cutting a Convex Polyhedron Out of a Sph

Cutting a Convex Polyhedron Out of a Sphere

✍ Syed Ishtiaque Ahmed; Masud Hasan; Md. Ariful Islam 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 253 KB

An approximation algorithm for cutting o

An approximation algorithm for cutting out convex polygons

✍ Adrian Dumitrescu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Two Algorithms for Decomposing a Polyhed

Two Algorithms for Decomposing a Polyhedron into Convex Parts

✍ M. Szilvási-Nagy 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

Successive Approximate Algorithm for Bes

Successive Approximate Algorithm for Best Approximation from a Polyhedron

✍ Shusheng Xu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Suppose K is the intersection of a finite number of closed half-spaces [K i ] in a Hilbert space X, and x # X "K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation of x from K, which is denoted by P K (x). Dykstra's algorithm redu

An algorithm for enumerating all vertice

An algorithm for enumerating all vertices of a convex polyhedron

✍ W. Altherr 📂 Article 📅 1975 🏛 Springer Vienna 🌐 English ⚖ 580 KB

Piecewise linear approximation of a non-

Piecewise linear approximation of a non-convex set by a polyhedron

✍ A.I. Samylovskii; B.G. Sushkov 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 928 KB