The Radii of Polyhedrons
Canadian journal of mathematics, Tome 35 (1983) no. 1, pp. 33-42
Voir la notice de l'article provenant de la source Cambridge University Press
1. Introduction. Let P be a polyhedron (i.e., a 3-dimensional polytope). A path in P is defined as a sequence of edges (x 1, x 2), ..., (x i−1, x i), (x i , x i−1), ..., (x n−1, xn ) where (xi , x i+1) denotes the edge with endpoints Xi and X i+1. Define the length |A| of a path A to be the number of edges of said path. The distance between any two vertices x and y of P is defined to be the least length of all paths of P between x and y. For the purposes of this paper, if x and y lie on a particular path A, the distance between x and y along A will be defined to be the length of the segment of A between x and y. The radius of P is defined to be the smallest integer r for which there exists a vertex v of P such that the distance from v to any other vertex of P is at most r.
Enns, T. C. The Radii of Polyhedrons. Canadian journal of mathematics, Tome 35 (1983) no. 1, pp. 33-42. doi: 10.4153/CJM-1983-002-3
@article{10_4153_CJM_1983_002_3,
author = {Enns, T. C.},
title = {The {Radii} of {Polyhedrons}},
journal = {Canadian journal of mathematics},
pages = {33--42},
year = {1983},
volume = {35},
number = {1},
doi = {10.4153/CJM-1983-002-3},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1983-002-3/}
}
[1] 1. Jucovic, E. and Moon, J. W., The maximum diameter of a convex polyhedron, Mathematics Magazine (1965), 31–32. Google Scholar
Cité par Sources :