B. Grunbaum. Convex polytopes. John Wiley & Sons, 1967.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....The Euler relation is the only a#ne relation satisfied by f vectors of all polytopes. For simplicial (or simple) d polytopes, there are additional relations, called the Dehn Sommerville equations, which provide a complete description of the a#ne space generated by all such f vectors [10]. The information contained in the f vector of a simplicial polytope is nicely summarized in the form of the h vector [18] In the case of the flag f vector, there is a large set of equations that are satisfied for all polytopes. The corresponding a#ne space has dimension given by the Fibonacci ....

B. Gr unbaum, "Convex Polytopes," John Wiley and Sons, London, 1967.

....set of k vertices is contained in a face of dimension at most 2k 1. The only theorem of this avour I am aware of is by Billera and Sarangarajan [17] who proved that every 0 1 polytope is a face of a travelling salesman polytope. RECONSTRUCTION THEOREM 19.5. 21 An extension of Whitney s theorem, [36] d polytopes are determined by their (d 2) skeletons. THEOREM 19.5.22 Perles (1973) unpublished) Simplicial d polytopes are determined by their bd=2c skeletons. This follows from the following theorem (here, ast(F; P ) is the complex formed by the faces of P that are disjoint to all vertices ....

....of convexity is a great challenge. 19.7 SOURCES AND RELATED MATERIAL FURTHER READING Gr unbaum [39] is a survey on polytopal graphs and many results and further references can be found there) More material on the topic of this chapter and further relevant references can also be found in [36], 108] 18] 65] and [14] Martini s chapter in [18] is on the regularity properties of polytopes (a topic not covered here; cf. Chapter 16) and contains further references on facet forming polytopes and nonfacets. The original papers on facet forming polytopes and nonfacets contain many more ....

B. Grunbaum. Convex Polytopes. Interscience, London, 1967.

....orthogonal projection of the skeleton (edge structure) of Q onto the (x; y) plane is depicted on Figure 2. In fact, if is very small, then Q hardly di ers from its projection. Let Q denote the polar polytope of Q, i.e. let Q = fp 2 j hp; qi 1 for every q 2 Qg: It is well known [G67], MS71] that there is a one to one correspondence between the vertices of Q and the faces of Q such that (i) two vertices of Q are joined by an edge if and only if the corresponding two faces of Q are adjacent; ii) the vector representing any vertex of Q is perpendicular to the ....

B. Grunbaum, Convex Polytopes, John Wiley and Sons, London, 1967.

....has the same structure. To verify that this is true, we have to establish what requirement the polytope must satisfy. It is well known that a necessary and sufficient condition for a graph to represent the edges of a linear convex polytope in E is that it must be planar and triply connected [12]. For k dimensional polytopes it is also known that the edges form a k connected graph (this condition is only necessary) In the case of the polytopes of a weak complex, these properties are not always satisfied because their faces can be partitioned. Consider, for example, the vertex v in ....

GR UNBAUM,B.Convex Polytopes. Wiley, New York, NY, 1967.

....and their underlying topological subspaces of Euclidean space (polyhedra) cf. say P.J. Hilton and S. Wylie [8] In many geometrical situations, attention is restricted mainly to the connected components of these polyhedra, and especially to the convex polyhedra (or polytopes) cf. B. Gr unbaum [5], or G.M. Ziegler [22] say. Some mathematicians studying such objects, starting apparently with Euler, have raised the problem of counting the combinatorial equivalence classes in various ways, but apparently only with limited success in general; cf. Gr unbaum [5] Chap. 13, Section 13.6. ....

....(or polytopes) cf. B. Gr unbaum [5] or G.M. Ziegler [22] say. Some mathematicians studying such objects, starting apparently with Euler, have raised the problem of counting the combinatorial equivalence classes in various ways, but apparently only with limited success in general; cf. Gr unbaum [5], Chap. 13, Section 13.6. However, substantial advances have occurred in recent years concerning asymptotic enumeration of the non isomorphic (combinatorially distinct) convex 3 polyhedra (or 3 polytopes) Let P E (n) denote the total number of combinatorially distinct convex 3 polyhedra with ....

B. Grunbaum, Convex Polytopes (Interscience, 1967).

....or Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1, 519) 888 4567 x4422, mmccool cgl.uwaterloo.ca http: www.cgl.uwaterloo.ca mmccool A simplex is a generalized triangle, defined as the convex hull of n 1 points in R . See Gr unbaum [10]. Published in SIGGRAPH 95; c #ACM 1995. Permission to make digital hard copy of part of all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the ....

Gr unbaum, Branko. Convex Polytopes. John Wiley & Sons, 1967.

....polytope whose faces are triangles) with 4k vertices there exists a subset of k vertices any two of which are connected by inner diagonals. However, in R 4 there exist simplicial polytopes COUNTABLY CONVEX G SETS 3 with any prescribed number of vertices and with no inner diagonals at all (see [6], p.61 or Example 4 below) The results are presented in two sections, which can be read independently of each other. Section 2 deals with G sets in nite dimensional spaces and Section 3 is devoted to a construction of bad countably convex G subsets in every in nitedimensional Banach space. ....

....convex G set may contain a dense in itself clique. Example 4. There is a countably convex G set in R 4 which contains a dense in itself 2 clique. Proof. In the construction we use the moments curve in R 4 and its supporting hyperplanes as presented in the construction of cyclic polytope [6], p. 61. For a real number t, let L(t) t; t 2 ; t 3 ; t 4 ) 2 R 4 , L = fL(t) t 2 [0; 1]g and S 1 = conv(L) Clearly, L is compact, and therefore S 1 is a compact convex subset of R 4 . For any two reals t 1 ; t 2 , the polynomial (t t 1 ) 2 (t t 2 ) 2 = P 4 0 a i t i takes ....

Branko Grunbaum. Convex polytopes. John Wiley & Sons,, 1967

....AND XIAOSHEN WANG instance, with n=3, the polynomial 3x 1 x 2 2 x 5 3 has support f(1; 0; 0) 0; 2; 5)g. The support of an n tuple of polynomials is simply the n tuple whose i th coordinate is the support set of the i th polynomial. We also let M(E) denote the n dimensional mixed volume [Gr u69, Roj94, HS95, Sch94, EC95, DGH96, VGC96] of the convex hulls of E 1 ; En , whenever E : E 1 ; En ) is an n tuple of nonempty nite subsets of Z n . When the support of f i is contained in E i for all i 2 f1; ng, we simply say that the support of F is contained in E. The convex hulls of the supports of the f i ....

....in E i for all i 2 f1; ng, we simply say that the support of F is contained in E. The convex hulls of the supports of the f i are commonly known as the Newton polytopes of F . For further background on the theory and applications of mixed volumes and Newton polytopes we refer the reader to [Gr u69, Roj94, GKZ94, Sch94, HS95, EC95, DGH96, LW96, VGC96, HS96, Roj96]. Remark 1. When one xes the support of F , it is not always true that the isolated roots of F avoid a given coordinate hyperplane for a generic choice of the coecients. We give examples of this phenomenon in the next section. Hence the ordinary BKK bound is insucient for accurate ....

Grunbaum, Branko, Convex Polytopes, Interscience, London, New York, Sydney, 1969.

....y; t) x; y) 2 Q(t)g 3 P Q n=2 vertices m=2 vertices v1 v2 path of v1 when Q is moved while keeping contact with v 2 Figure 1: Two convex polygons with Omega Gamma1 8 nm 2 n 2 m) distinct placements. Following Avis et al. 4] we can now apply the BrunnMinkowski theorem [13], which states that the square root of the function that describes the area of intersection of PPQ and a horizontal plane h is downwards concave, as we sweep h through PPQ . Since the crosssection of PPQ with the horizontal plane t = t is exactly the intersection A(t ) the theorem follows. A ....

B. Gr#nbaum. Convex Polytopes. Wiley, New York, NY, 1967.

....Large Neighborly Families of Congruent Symmetric Convex 3 Polytopes Je Erickson University of Illinois at Urbana Champaign je e cs.uiuc.edu http: www.cs. uiuc.edu je e June 12, 2001 Abstract We construct, for any positive integer n, a family of n congruent convex polyhedra in IR 3 , such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi regions of evenly distributed points ....

....cyclic polytopes and the Petrie polytopes, respectively, and showed that the two families are combinatorially equivalent. Cyclic polytopes were independently rediscovered by Motzkin [18, 13] and Sa skin [20] among others. For further discussion of neighborly and cyclic polytopes, see Gr unbaum [12] and Ziegler [29] Partially supported by a Sloan Research Fellowship and NSF CAREER award CCR 0093348. See http: www. cs.uiuc.edu je e pubs crum.html for the most recent version of this paper. 2 Arbtirarily Large Neighborly Families of Congruent 3 Polytopes Dewdney and Vranch [8] showed ....

B. Grunbaum. Convex Polytopes. John Wiley & Sons, New York, NY, 1967.

....h j 1 h j : The only proof known for the GLBT goes via the g theorem, which characterizes all possible h vectors of simplicial d polytopes [4, 17, 14] Orthogonal dual. We describe a duality between sequences of n points in IR d and IR n d 1 that is closely related to the Gale transform, cf [9, 20] (see remark preceding Lemma 2) This will allow us to relate the h vector of simplicial convex polytopes to the h sequences we have considered in Section 2. 1 Sometimes, the statement is presented for j d=2. But for d odd and j = d 1) 2, we have h j 1 = h j because of the Dehn Sommerville ....

Branko Grunbaum, Convex Polytopes, Interscience (1967)

....F is a facet of Q, and that W is a wedge over Q with foot F . Then W is a simple d polytope with f facets, and the number of inner diagonals of W is twice the number of inner diagonals of Q that miss F . For other basic properties of polytopes, the reader is referred to the books of Grunbaum [Gr1] and Ziegler [Zi] 2. Inner diagonals of 3 polytopes This section is concerned with the combinatorial structure of 3 polytopes, or, in view of Steinitz s theorem [SR] Gr1] with 3 connected planar graphs. The facets of a 3 polytope correspond to the nonseparating simple cycles in its graph, and ....

....inner diagonals of Q that miss F . For other basic properties of polytopes, the reader is referred to the books of Grunbaum [Gr1] and Ziegler [Zi] 2. Inner diagonals of 3 polytopes This section is concerned with the combinatorial structure of 3 polytopes, or, in view of Steinitz s theorem [SR] [Gr1], with 3 connected planar graphs. The facets of a 3 polytope correspond to the nonseparating simple cycles in its graph, and two vertices are joined by an inner diagonal if and only if they do not lie together on 4 DAVID BREMNER AND VICTOR KLEE any such cycle. We shall continue to use the ....

[Article contains additional citation context not shown here]

B. GR UNBAUM, Convex Polytopes, Interscience/Wiley, London, 1967.

....in R d , contains n points in convex position. Thus, f(n) f 2 (n) For d 3, the only known values of f d (n) are f d (n) 2n d 1 for d 1 n b3d=2c 1 (see [1] for the upper bound and [7] for the lower bound) and f 3 (6) 9 [1] The study of f d (n) was initiated by Gr unbaum in [4] who also established its existence for every n d via Ramsey s theorem. A more e ective general upper bound f d (n) f(n) follows from a simple projective argument (see [10] and is slightly improved to f d (n) f(n d 2) d 2 2n 2d 1 n d d in [6] The aim of the present paper is to ....

B. Gr unbaum, Convex Polytopes, Wiley, New York, 1967.

....relation is the only affine relation satisfied by f vectors of all polytopes. For simplicial (or simple) d polytopes, there are b d Gamma1 2 c additional relations, called the Dehn Sommerville equations, which provide a complete description of the affine space generated by all such f vectors [10]. The information contained in the f vector of a simplicial polytope is nicely summarized in the form of the h vector [18] In the case of the flag f vector, there is a large set of equations that are satisfied for all polytopes. The corresponding affine space has dimension given by the Fibonacci ....

B. Gr unbaum, "Convex Polytopes," John Wiley and Sons, London, 1967.

.... g 0 0 = 60f05 10f057 60f16 30f036 60f06 48f15 8f157 12f135 2f1357 18f035 3f0357 12f046 6f146 6f025 f0257 18f136 12f026 [4] g 0 0 g 2 1 g 4 1 g 0 0 = 6f146 6f046 6f147 6f047 30f03 9f035 15f036 15f037 30f14 30f04 f0246 f0247 20f13 5f024 6f135 10f136 10f137 [5] g 0 0 g 2 1 g1 4 g 0 0 = 30f03 15f035 15f036 9f037 30f14 30f04 20f13 5f024 10f135 10f136 6f137 [6] g 3 0 g 4 2 g 0 0 = 3f246 3f146 3f046 f247 f147 f047 20f3 4f35 10f36 4f37 10f24 10f14 10f04 [7] f0 78) g 4 2 g 0 0 = 3f0246 f0247 20f03 4f035 10f036 ....

B. Grunbaum, Convex Polytopes, Interscience, London 1967.

.... optimal space and time algorithms have been established for sets of points in dimension d [Cla87, Cha91, Br#95] However, the convex hull of n points in general position in a d dimensional space ranges from the d simplex with (d 1) faces to maximal polytopes of size O(n b d 2 c ) see [Gr#67, McM70] We are interested in designing algorithms whose time complexity depends on both the input and output sizes: the so called output sensitive algorithms. Optimal output sensitive algorithms for points are known only in dimensions 2 and 3 by the time being. D.G. Kirkpatrick and R. Seidel ....

B. Gr#nbaum. Convex Polytopes. Wiley, New York, NY, 1967.

.... as follows: given the three dimensional polytope P PQ , is the square root of the function that describes the area of intersection of P PQ and a horizontal plane h convex, as we sweep h through P PQ As Avis et al. ABS 96] we remark that a direct application of the Brunn Minkowski theorem [Gr#67] allows to conclude that this is indeed the case if P PQ is convex. INRIA Overlap of Two Convex Polygons 9 To prove that P PQ is convex, it suOEces to write it as the intersection of two convex polytopes P PQ = f(x; y; t) x; y) 2 Pg f(x; y; t) x; y) 2 Q(t)g 2 Theorem 3.2 Let P and Q ....

B. Gr#nbaum. Convex Polytopes. Wiley, New York, NY, 1967.

No context found.

B. Grunbaum. Convex polytopes. John Wiley & Sons, 1967.

No context found.

GR UNBAUM, B. 2003. Convex polytopes, second ed., vol. 221 of Graduate Texts in Mathematics. Springer-Verlag, New York.

No context found.

Gr unbaum, B., Klee, V., Perles, M. A., and Shephard, G. C.: Convex Polytopes. John Wiley & Sons, New York, NY, 1967.

No context found.

Branko Gr unbaum. Convex Polytopes. John Wiley & Sons, 1967.

No context found.

Gr unbaum, B. (2003), Convex Polytopes, 2nd ed. Springer, New York.

No context found.

B. Grunbaum, Convex Polytopes, Interscience, London, 1967.

No context found.

B.Gr#unbaum, Convex Polytopes,Interscience, New York, 1967.

No context found.

B.Gr#ubaum, Convex Polytopes,Interscience, New York, 1967.

First 50 documents

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