Skip to main content
broken image fixed (click 'rendered output' or 'side-by-side' to see the difference; image retrieved via Wayback Machine); for more info, see https://meta.mathoverflow.net/a/4058/70594
Source Link

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle PackingCircle Packing
(source: uci.edu)

(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing
(source: uci.edu)

(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

replaced http://www.ics.uci.edu/ with https://www.ics.uci.edu/
Source Link

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing http://www.ics.uci.edu/~eppstein/0xDE/KesPacPal-GD-10.pngCircle Packing
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing http://www.ics.uci.edu/~eppstein/0xDE/KesPacPal-GD-10.png
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

added 1 characters in body
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing http://www.ics.uci.edu/~eppstein/0xDE/KesPacPal-GD-10.png
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing http://www.ics.uci.edu/~eppstein/0xDE/KesPacPal-GD-10.png
(Image due to David Eppstein here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

The Koebe–Andreev–Thurston theorem states that any planar graph can be represented "in such a way that its vertices correspond to disjoint disks, which touch if and only if the corresponding vertices are adjacent" (to quote Günter Ziegler, Lectures on Polytopes, Springer, 1995 p.117. (See also the Wikipedia article, "Circle packing theorem.")
          Circle Packing http://www.ics.uci.edu/~eppstein/0xDE/KesPacPal-GD-10.png
(Image due to David Eppstein, here.)

What is the corresponding statement for spheres in $\mathbb{R}^3$? Every graph $G$ satisfying property $X$(?) can be represented by touching spheres.

This is surely known—Thanks for pointers!

Added image.
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958
Loading
Source Link
Joseph O'Rourke
  • 150.9k
  • 36
  • 358
  • 958
Loading