H. S. M. Coxeter. Regular Polytopes. Dover Publications, New York, NY, 1973.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the right and which one is on the left. Starting at an arbitrary vertex and walking along one of the three edges adjacent to it, we can choose an alternating path by taking the right and the left direction alternatively whenever we approach a new vertex. Such a path is called a Petrie path (c.f. [5]) Suppose the edges we are walking along are the edges e 1 ; e 2 ; Since our graph is finite, there is some smallest n 0, so that (independent of direction) e n 1 = e n for some index n with 1 n n. If e n 1 = e 1 and e n 2 = e 2 , we have a closed Petrie path (a Jordan curve ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, Inc, 1973.

....non isomorphic, but switching equivalent, graphs. For de nitions and discussion of this situation in more general setting, see e.g. BCN89, pp.103 105] Equicut polytopes. The skeletons of many nice polytopes are equicut graphs. Below we list several such examples. We follow the terminology from [Joh66, Cox73]. All ve Platonic solids have equicut skeletons; all, except the Tetrahedron, are rigid. All but the cube (of scale 1) have scale 2. The sizes for the Tetrahedron, the Octahedron, the Cube, the Icosahedron and the Dodecahedron are 3=2, 2, 3, 3 and 5. The skeleton of any zonotope (see e.g. ....

.... K s 2 (cross polytope) There are just 3 semiregular 1 polytopes of dimension greater than 3, see [DeSh96] Two of them have equicut skeletons: H(5; 2) and the snub 24 cell s(3; 4; 3) see Figure 1. The latter is a 4 dimensional semiregular polytope with 96 vertices (see, for example, [Cox73]) the regular 4 polytope 600 cell can be obtained by capping its 24 icosahedral facets. Its skeleton has scale 2 and size 6; it is a doubling. Three of the chamfered (see [DeSh96] Platonic solids have 1 skeletons: chamfered Cube is a zonohedron of size 7, chamfered Dodecahedron is an equicut ....

H.S.M.Coxeter, Regular Polytopes, Dover Publications, New York,1973.

....by an edge. For instance, a simplex in one dimension is a line, which is enclosed by two points (a point has dimension zero) A simplex in two dimensions is a triangle, which is enclosed by three lines. A simplex in three dimensions is a tetrahedron, which is enclosed by four planes, and so on [11]. A regular simplex is one in which each edge has the same length. A simplex thus has certain properties that make it easier to use as the generalization of a line segment than a hypercube or a hypersphere. For instance, observe that the number of faces, corner points, and edges of a simplex is ....

H. S. M. Coxeter. Regular Polytopes. Dover Publications, Inc., New York, second edition, 1973.

.... points regularly on a sphere, i.e. to let the control points be the vertices of a regular polyhedron (in case of eight control points, they should be placed like the corners of a cube) Unfortunately there is no regular polyhedron with more than twenty vertices, as proved by Plato some time ago [4]. A solution is to create a quasi regular polyhedron with equal distances between each vertex and its neighbours. Such polyhedra can be created recursively from an icosahedron, see Figure 4.1, using the following algorithm: 1. Place a new vertex at the midpoint of each edge. 2. Remove the old ....

H. S. M. Coxeter. Regular polytopes, Dover Publications, 1973.

....D) R n . Proposition 4 For all P , Q in D, Voronoi(P; D) is congruent to Voronoi(Q; D) Fig. 4 shows a piece of A 2 and the Voronoi cell (dashed lines) around the origin, 0, of A 2 . 0 Figure 4: A piece of M(A 2 ) with the Voronoi cell around M( 0) 21 A Voronoi cell is a polytope [Cox73] i.e. the n dimensional analog of a polyhedron in 3 dimensions or a polygon in 2 dimensions. Thus, Voronoi cells have faces and vertices . It is useful to consider the following fact about Voronoi cells around lattice points. Since all Voronoi cells in a lattice are congruent, it is ....

H. S. M. Coxeter. Regular Polytopes. Dover Publications, 1973.

....a (n 1)D hypercube should have opposite orientation in the two nD hypercube. We can see with the help of Fig. 3 what these denitions mean in case of a 2D square and a 3D cube. If the reader is interested in more detail the geometry of polytopes, he she is referred to an excellent introduction [2]. Once the direction of any one line segment is xed, then the orientation of hypercubes in an nD grid is determined. To get a coherent generalization of the orientation RR n Sigma2833 10 M#rta Fidrich conventions used in the Marching Lines algorithm, we complete this description with the ....

....(1 chains) into hyper cycles (2 chains) Cycles or 1 chains are oriented, not necessarily planar polygons, while hy per cycles or 2 chains are oriented, not necessarily 3D polyhedra whose faces are exactly the above mentioned cycles. For a complete denition the interes ted reader is referred to [2, 7]. We emphasize that not only the cycles, but also the reconstructed hyper cycles are oriented, and this orientation is coherent with the orientation of the corresponding hypercubes. That is, adjacent cycles composing the hyper faces of a hyper cycle have opposite orientation, and li kewise: ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, 1973.

....Superimpose two solid tetrahedra in such a way that a vertex of one pierces a face of the other. Then their union (Figure 1) is a polyhedron for which one face is multiply connected; but this does not deserve to be called a holyhedron since the other faces are not. Kepler s Stella Octangula [1] [2] of Figure 2 comes closer to being an example, if we regard it as having eight faces that are each composed of three triangles as in Figure 3. These faces are certainly multiply connected (as closed sets) but since they are only connected by points, it seems more natural to disbar this ....

Coxeter, H.S.M. Regular Polytopes, p. 48-51. Dover Publications, New York, 1973.

.... voxels of the given face cube into the voxels of the base cube; compute the iso patch cycles in the base 8 cell; compute the bi iso segments in the base 8 cell; endfor organize the obtained cycles into hyper cycles; organize the obtained segments into hyper segments; Hyper segments or cycles [5] are oriented, not necessarily planar polygons, while hyper cycles are oriented, not necessarily 3D polyhedra whose faces are exactly the above mentioned cycles. I emphasize that not only the cycles, but also the reconstructed hyper cycles are oriented, and this orientation is coherent with the ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, 1973.

.... voxels of the given face cube into the voxels of the base cube; compute the iso patch cycles in the base 8 cell; compute the bi iso segments in the base 8 cell; endfor organize the obtained cycles into hyper cycles; organize the obtained segments into hyper segments; Hyper segments or cycles [2] are oriented, not necessarily planar polygons, while hyper cycles are oriented, not necessarily 3D polyhedra whose faces are exactly the above mentioned cycles. We emphasize that not only the cycles, but also the reconstructed hyper cycles are oriented, and this orientation is coherent with the ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, 1973.

....structural isomorphism. For fullerenes with about 100 atoms, the 9 e e 2 1 Figure 1a: A Jordan curve Petrie path. program appears to be faster by more than three million times than previous (incomplete) ones. In that algorithm, the Divide Conquer strategy is applied using Petrie paths (cf. [9]) to reduce the problem of enumerating all fullerene structures with a given number of C atoms to solving corresponding pairs or triplets of PentHex Puzzles (cf. Fig. 1 and 2) A Petrie path in a fullerene is a sequence of edges e 1 ; e 2 ; e k such that any two consecutive edges e i ; e ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, Inc, 1973.

....Let G be one of them. Proposition 2.3 Let P be a point with trivial stabiliser in G. Then, P has at most 6 external neighbours and at most 5 internal neighbours in V or GP . Proof: Every group generated by reflexions is a direct product of groups whose fundamental domains are simplexes (see [Coxeter 73, page 187 212] Therefore the reflexion cells are products of simplices. The possibilities are a tetrahedron, a triangular prism and a rectangular prism, so that the maximal number of facets of the reflexion cell is 6. The points which are inside R are all at equal distance to the centroid of R, ....

H.S.M. Coxeter, Regular Polytopes, Dover Publications, INC. New York, 1973.

....(the so called Green machine described in [40] 41] 58] 50, Chap. 14] This computes the 2 m 1 inner products x . u , u e # , in about m2 m steps. It is worth pointing out that a first order Reed Muller code is geometrically similar to an octahedron (b n in Coxeter s notation [30]) For example, the codewords of the code of length 4 shown in Fig. 1a when multiplied by the orthogonal matrix of Fig. 1b become the 8 vertices ( 2 , 0 , 0 , 0) 0 , 0 , 0 , 2) of a 4 dimensional octahedron. 1) The footnotes are on page 30. 5 A [2 m 1 , m] ....

....30] may be decoded by a straightforward modification of the fast Hadamard transform. Set one of the inputs, say the last, to zero, and only calculate the linear combinations in which the last variable occurs with a sign. This code is geometrically similar to a simplex (a n in the notation of [30]) 2.3) The universe code n , consisting of all binary vectors of length n, may be decoded in just n steps. To decode x = x 1 , x n ) we simply replace each x i by sgn(x i ) where sgn(x) 1 if x 0 , 1 if x 0 . This is more efficient even than the fast Hadamard transform ....

[Article contains additional citation context not shown here]

H. S. M. Coxeter, Regular Polytopes, Dover Publications, N.Y., 3rd ed., 1973.

....closed sphere. Theorem 3.1.6 The union of any collection of open sets in R n is an open set in R n , and the intersection of a finite collection of open sets in R n is an open set in R n . We note here that the above definition of tessellate is not the same as the usual definition [Cox73] although the basic concept is identical. Our definition is convenient for our purposes. 3.2 Representing Euclidean Space by Meshes In Section 3.2.1 we motivate (as in [CRS90a] and formally define the class of regular lattices. In that section we note that amongst n dimensional regular ....

....smallest set of vectors in D so that R2Rel(D) H(R;D) Voronoi( 0; D) 2. For each vector R 2 Rel(D) the face, corresponding to R, of Voronoi( 0; D) denoted FaceR ( 0; D) is given by FaceR ( 0; D) fx 2 Voronoi( 0; D) j (x; R) R; R) 2g: Note 3.4. 1 It can be shown [CS88, Cox73] that FaceR ( 0; D) for any R 2 Rel(D) is a bounded, n Gamma 1) dimensional planar surface perpendicular to R. We now prove a few facts about relevant vectors in an n dimensional lattice. Theorem 3.4.1 Rel(D) is finite. CHAPTER 3. PRELIMINARIES 40 Proof. The closure of the Voronoi ....

H. S. M. Coxeter. Regular Polytopes. Dover Publications, 1973.

.... the voxels of the given face cube into the voxels of the base cube; compute the iso patch cycles in the base 8 cell; compute the bi iso segments in the base 8 cell; endfor organize the obtained cycles into hyper cycles; organize the obtained segments into hyper segments; Hyper segments or cycles [3] are oriented, not necessarily polygons, while hypercycles are oriented, not necessarily 3D polyhedra whose faces are exactly the above mentioned cycles. We emphasize that not only the cycles, but also the reconstructed hyper cycles are oriented, and this orientation is coherent with the ....

H.S.M. Coxeter. Regular Polytopes. Dover Publications, 1973.

....triangles; however, in higher dimensions, the computational performance will depend greatly on the choice of simplexes that cover the configuration space. Ideally, one would like to construct a simplicial complex such that all d dimensional simplexes are regular polytopes; however, as shown in [7], this is impossible, even in 3 (e.g. 3 cannot be tiled with identical tetrahedra, each of which having all faces be equilateral triangles) We have recently shown that cubes or hypercubes can be triangulated using barycentric subdivision to yield a simplicial complex with very desirable ....

H. S. M. Coxeter. Regular Polytopes. Dover Publications, New York, NY, 1973.

....theory, and many other fields; see, e.g. 4, 9, 19] This reveals the fact that the hypercube is the most natural geometric structure combining all binary digits of length d. The theory of convex polytopes provides classical results concerning sections and projections of hypercubes (see e.g. [8, 10]) as well as for so called subpolytopes of Research supported by the Spezialforschungsbereich F 003, Optimierung und Kontrolle. the d cube [20] In this paper we consider the convex hull of a subset V f0; 1g d of hypercube vertices. A polytope P representing the convex hull of V is called ....

H.S.M. Coxeter, Regular Polytopes, Dover Publications, New York, 1963/73

....objects is the d dimensional hypercube (d cube) C d = 0; 1] d . Dispite of its simple definition, C d has been an object of study from various different points of view. The theory of convex polytopes provides classical results concerning sections and projections of hypercubes; see Coxeter [3] and Grunbaum [6] Purely combinatorial properties of C d , mainly involving certain subgraphs formed by its edges and vertices (the latter are just the various d tuples of binary digits) have been investigated extensively in coding theory and in communication theory; see, e.g. 4, 2, 11, 5] ....

....of the d cube, and the convex hull of all the vertices lying on the hyperplane is no longer the surface of intersection of hyperplane and d cube. Hull honest hyperplanes seem to be the only type in H(C d ) which has been studied previously, motivated by the intersection polytopes they generate [3]. We now give an easy to use criterion to characterize hullhonest hyperplanes, and we also give the exact number of such hyperplanes, in general dimensions. 3) Let H 2 H(C d ) be a hyperplane through the origin (which is no loss of generality) and let v = v 1 ; v d ) be the (shortest ....

[Article contains additional citation context not shown here]

Harald S. M. Coxeter, Regular Polytopes, Dover Publications, New York, 1963/73

....table speci es sizes of the minimal and maximal triangulations for some Platonic and Archimidean solids. These results were obtained via integer programming calculations using the approach described in [8] All computations used the canonical symmetric coordinatizations for these polytopes [6]. The number of vertices is indicated in parenthesis (Remark 4.5) P jT min (P )j jTmax (P )j Icosahedron (12) 15 20 Dodecahedron (20) 23 36 Cuboctahedron (12) 13 17 Icosidodecahedron (30) 45 Truncated Tetrahedron (12) 10 13 Truncated Octahedron (24) 27 Truncated Cube (24) 25 48 Small ....

H.S.M. Coxeter, Regular Polytopes, Dover Publications, New York, 1973.

....3. The following table specifies sizes of the maximal and minimal triangulations for some Archimidean solids. These results were obtained via integer programming calculations using the approach described in [7] All computations used the canonical symmetric coordinatizations for these polytopes [5]. The number of vertices is indicated in parenthesis (Remark 4.5) P jT min (P )j jTmax (P )j Icosahedron (12) 15 20 Dodecahedron (20) 23 36 Cuboctahedron (12) 13 17 Icosidodecahedron (30) 45 Truncated Tetrahedron (12) 10 13 Truncated Octahedron (24) 27 Truncated Cube (24) 25 48 Small ....

H.S.M. Coxeter, Regular Polytopes, Dover Publications, New York, 1973.

....of the representation of the symmetry group in U . These dimensions could of course have been computed using the character table of the group, but linear algebra obtains the answer in a computationally simpler way. Eigenvalues The list of all regular polytopes in all dimensions is well known ([C]) and we shall almost always use Schlafli symbols to denote them. In dimension 2 we have the regular n gons fng, for n 3. In dimension 3 we have the tetrahedron f3; 3g, the octahedron f3; 4g, the cube f4; 3g, the icosahedron f3; 5g and the dodecahedron f5; 3g. In dimension 4 we have six ....

....order. There are two easy ways to compute the matrices B, B e and B o for P = f3; 4; 3g. One way would be to study in some detail the combinatorial structure of the polytope, as will be done in the next example. Another way would be to use the following simple 4 coordinates for the vertices ([C], p. 156) they are the 24 permutations of the coordinates of the vectors ( Sigma1; 0; 0; 0) and ( Sigma 1 2 ; Sigma 1 2 ; Sigma 1 2 ; Sigma 1 2 ) From the coordinates, the adjacency relations among levels are obvious and, for P = f3; 4; 3g, we have B e = 0 0 8 0 1 4 3 0 8 0 1 A ....

[Article contains additional citation context not shown here]

H. S. M. Coxeter,Regular Polytopes, Dover Publications, Inc., New York, 1963

No context found.

H. S. M. Coxeter. Regular Polytopes. Dover Publications, New York, NY, 1973.

No context found.

H. S. M. Coxeter. Regular Polytopes. Dover Publications, New York, NY, 1973.

No context found.

Coxeter, H.S.M. Regular Polytopes. Dover Publications, Inc., New York, 1963.

No context found.

H.S.M. Coxeter, Regular polytopes, 3rd edition, Dover Publications, Inc., New York, 1973.

No context found.

H. S. M. Coxeter, Regular Polytopes, Dover Publications, 1973.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC