Convex Polytopes

نویسندگان

  • B. GRUNBAUM
  • G. C. SHEPHARD
چکیده

The study of convex polytopes in Euclidean space of two and three dimensions is one of the oldest branches of mathematics. Yet many of the more interesting properties of polytopes have been discovered comparatively recently, and are still unknown to the majority of mathematicians. In this paper we shall survey the subject, mentioning some of the most recent results, and stating the more important unsolved problems. In order to make the exposition as self-contained as possible, in §2.1 and §3.1 we give a number of definitions with which the reader may not be familiar. We have separated our account of the combinatorial properties of polytopes in §2, from those of a metrical character in §3. As will be seen, these two aspects of the subject overlap, and distinguishing between them is, to a large extent, a matter of expository convenience only. It is beyond the scope of the present survey to indicate proofs of the results mentioned. For these the reader is referred either to the original papers, or, for the earlier results, to the standard textbooks. In the notes references are given to recent publications, and in these, precise references to the older literature may be found. It has, of course, been necessary to make a small selection from the vast amount of published material. To some extent the selection has been made according to the authors' personal interests, but we hope that it nevertheless represents a reasonably balanced account of our subject. Before the beginning of this century, three events can be picked out as being of the utmost importance for the theory of convex polytopes. The first was the publication of Euclid's Elements which, as Sir D'Arcy Thompson once remarked, was intended as a treatise on the five regular (Platonic) 3-polytopes, and not as an introduction to elementary geometry. The second was the discovery in the eighteenth century of the celebrated Euler's Theorem (see §2.2) connecting the numbers of vertices, edges and polygonal faces of a convex polytope in E. Not only is this a result of great generality, but it initiated the combinatorial theory of polytopes. The third event occurred about a century later with the discovery of polytopes in d ^ 4 dimensions. This has been attributed to the Swiss mathematician Ludwig Schlafli; it happened at a time when very few mathematicians (Cayley, Grassmann, Mobius) realised that geometry in more than three dimensions was possible. During the latter hah of the nineteenth century a large'amount of work concerning polytopes was done, mostly extending the earlier metrical work to d ^ 4 dimensions. The symmetry groups of polytopes were extensively studied (see §3.4) and the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic approximation of smooth convex bodies by general polytopes

For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...

متن کامل

Abstract Steiner Points for Convex Polytopes

STEINER POINTS FOR CONVEX POLYTOPES CHRISTIAN BERG Let & denote the set of all convex polytopes, degenerate or not, in ^-dimensional Euclidean space E. An abstract Steiner point for convex polytopes in E is a mapping S:2P-+E satisfying S(P+Q) = S(P) + S(Q) for all P, Qe0*, (1) addition on the left being Minkowski addition of convex sets, and S{a(P)) = o{S(P)) (2) for all Pe&* and all similarity...

متن کامل

Convex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes

Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a parametric implicit shape model called Disjunctive Normal Shape Model (DNSM). The DNSM is formed as a union of polytopes which themselves are formed by intersections ...

متن کامل

A case when the union of polytopes is convex

We present a necessary and sufficient condition for the union of a finite number of convex polytopes in Rd to be convex. This generalises two theorems on convexity of the union of convex polytopes due to Bemporad et al. © 2004 Elsevier Inc. All rights reserved. AMS classification: Primary 52A20, 52A35; Secondary 52B11, 52B55

متن کامل

The Perles-Shephard identity for non-convex polytopes

Using the theory of valuations, we establish a generalization of an identity of Perles-Shephard for non-convex polytopes. By considering spherical valuations, we obtain the Gram-Euler, Descartes and Euler-Poincar e theorems for non-convex polytopes.

متن کامل

Tiling Three-space by Combinatorially Equivalent Convex Polytopes

The paper settles a problem of Danzer, Griinbaum, and Shephard on tilings by convex polytopes. We prove that, for a given three-dimensional convex polytope P, there is a locally finite tiling of the Euclidean three-space by convex polytopes each combinatorially equivalent to P. In general, face-to-face tilings will not exist.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1967