𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nonconvex polyhedra by repeated truncation of semiregular polyhedra

✍ Scribed by Alexandru T. Balaban

Publisher
Springer
Year
2009
Tongue
English
Weight
312 KB
Volume
47
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the sphericity of the graphs of semir
On the sphericity of the graphs of semiregular polyhedra
✍ Hiroshi Maehara πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 272 KB

The sphericity of a graph G is the smallest integer n such that G can be represented as the intersection graph of a family of unit-diameter spheres in Euclidean n-space E n. We determine here the sphericities of the graph of semiregular polyhedra in E 3 except a few prisms.

Rule-extraction by backpropagation of po
Rule-extraction by backpropagation of polyhedra
✍ F. Maire πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 450 KB

The core problem of rule-extraction from feed-forward networks is an inversion problem. In this article, we solve this inversion problem by backpropagating unions of polyhedra. We obtain as a by-product a new rule-extraction technique for which the fidelity of the extracted rules can be made arbitra

Simultaneous blending of convex polyhedr
Simultaneous blending of convex polyhedra by algebraic splines
✍ Haining Mou; Guohui Zhao; Zhirui Wang; Zhixun Su πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 973 KB

In this paper, we present a method of simultaneous blending of implicitly defined convex polyhedral angles and solid models. This algorithm starts with a new suitable partition of the n-simplex over which the algebraic splines are defined. Then a cubic algebraic spline is constructed which meets the