𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum sphere covering a convex polyhedron

✍ Scribed by Jack Elzinga; Donald Hearn

Publisher
John Wiley and Sons
Year
1974
Tongue
English
Weight
179 KB
Volume
21
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the section of a convex polyhedron
On the section of a convex polyhedron
✍ Peter Frankl; Hiroshi Maehara; Junichiro Nakashima πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 117 KB

Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P. For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths o

Minimum-energy configurations for charge
Minimum-energy configurations for charges on the surface of a sphere
✍ S. Webb πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 412 KB

In this paper evidence is presented that N charges allowed to distribute wtthin a sphere will reside on the surface and the mnnmum-energy states up to N=45 are given. The results vindicate classical electrostatics theory. \* (B) is not used in order to avoid confusion with Berezin's planar B.

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
✍ Noga Alon; Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over