Branko Grünbaum

Publications

    Most Recent: 

• 249     Are your polyhedra the same as my polyhedra?, Discrete and Computational Geometry: The Goodman-Pollack Festschrift.  B. Aronov,  S. Basu,  J. Pach,  and  Sharir, M., eds.  Springer,  New York 2003, pp. 461 – 488.
  
• 248.    Families of point-touching squares.  Geombinatorics 12(2003), 167 – 174.
• 247.    Convex Polytopes. 2nd ed., V. Kaibel, V. Klee and G. M. Ziegler, eds. Graduate Text in Mathematics, vol. 221. Springer, New York 2003.
• 246.    "New" uniform polyhedra. Discrete Geometry: In Honor of W. Kuperberg's 60th Birthday Monographs and Textbooks in Pure and Applied Mathematics, vol. 253. Marcel Dekker, New York, 2003.  Pp. 331 – 350 and Table.
• 245.    Connected (n4) configurations exist for almost all n – an update. Geombinatorics 12(2002), 15 – 23.
• 244.    No-net polyhedra. Geombinatorics 11(2002), 111 – 114.
• 243.    Levels of orderliness: global and local symmetry. Symmetry 2000, Proc. of a symposium at the Wenner–Gren Centre, Stockholm. Hargitai and T. C. Laurent, eds. Portland Press, London 2002.  Vol. I, pp. 51 – 61.
• 242.    The Grunert point of pentagons. Geombinatorics 11(2002), 78 - 84.
• 241.    Convexification of polygons by flips and by flipturns. (With J. Zaks) Discrete Math. 241(2001), 333 - 342.
• 240.    Isohedra with dart-shaped faces. (With G. C. Shephard) Discrete Math. 241(2001), 313 - 332.
• 239.    A starshaped polyhedron with no net. Geombinatorics 11(2001), 43 – 48.
• 238.    A convex polyhedron which is not equifacettable.  Geombinatorics 10(2001), 165 – 171.
• 237.    Face-transitive polyhedra with rectangular faces and icosahedral symmetry. (With H. S. M. Coxeter) Discrete & Comput. Geometry 25(2001), 163 – 172.
• 236.    A relative of "Napoleon's theorem". Geombinatorics 10(2001), 116 - 121.
• 235.    Connected (n4) configurations exist for almost all n. Geombinatorics 10(2000), 24 - 29.
• 234.    Parallelogram-faced isohedra with edges in mirror-planes. Discrete Math.  221(2000), 93 - 100.
• 233.    Which (n4) configurations exist ?  Geombinatorics 9(2000), 164 - 169.
• 232.    Astral (n4) configurations. Geombinatorics 9(2000), 127 - 134.
• 231.    Convex drawings of intersecting families of simple closed curves.
      (With Bette Bultena and Frank Ruskey)
      11th Canadian Conference on Computational Geometry, 1999, 18-21. 
• 231a    Convex drawings of intersecting families of simple closed curves
      Extended version. With Bette Bultena and Frank Ruskey
• 230.    Omittable points.
      Geombinatorics 9(1999), 57 - 62.
• 229.    Monochromatic intersection points in families of colored lines.
      Geombinatorics 9(1999), 3 – 9.
• 228.    The search for symmetric Venn diagrams.
      Geombinatorics 8(1999), 104 - 109.
• 227.    Selfintersections of polyarcs.
      Geombinatorics 8(1998), 78 - 85.
• 226.    Isohedra with nonconvex faces.
      (With G. C. Shephard).
      J. of Geometry  63(1998), 76-96.
• 225.    Acoptic polyhedra.
      In: "Advances in Discrete and Computational Geometry", B. Chazelle, J.E.     Goodman and R. Pollack, eds., Contemporary Mathematics, (1998) AMS,     Providence, RI. Pp.163 - 199.
• 224.    Selfintersections of polygons.
      Geombinatorics 8(1998), 37 - 45.
• 223.    How many triangles ?
      Geombinatorics 8(1998), 154 - 159.
• 222.    Some new transversality properties.
      (With G. C. Shephard)
      Geometriae Dedicata 71(1998), 179 - 208.
• 221.    Realizations of symmetric maps by symmetric polyhedra.
      Discrete & Comput. Geometry 20(1998), 19 - 33.
• 220.    Face-transitive polyhedra with rectangular faces.
      (With H. S. M. Coxeter)
      Math. Reports Acad. Sci. Canada 20(1998), 16 - 21.
  
  

• Older publications.
  

Current Research

1. Polyhedra in a general sense (not necessarily convex).
2. Configurations of points and lines in the Euclidean or real projective planes.
3. Graphs, in particular their imbeddings in manifolds.
4. Tilings and patterns in the plane and in space.