Name
Abstract | ||
|---|---|---|
Steinitz's theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of the embedded graph. Its faces are bounded by convex polygons whose points are coplanar. A map on the torus does not necessarily have such a geometric realization. In this paper we relax the condition that faces are the convex hull of coplanar points. We require instead that the convex hull of the points on a face can be projected onto a plane so that the boundary of the convex hull of the projected points is the image of the boundary of the face. We also require that the interiors of the convex hulls of different faces do not intersect. Call this an exhibition of the map. A map is polyhedral if the intersection of any two closed faces is simply connected. Our main result is that every polyhedral toroidal map can be exhibited. As a corollary, every toroidal triangulation has a geometric realization. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s00454-007-1354-3 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Convex Hull,Geometric Realization,Simple Cycle,Antipodal Point,Boundary Cycle | Orthogonal convex hull,Topology,Combinatorics,Convex combination,Convex hull,Krein–Milman theorem,Convex set,Steinitz's theorem,Convex polytope,Convex analysis,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 3 | 0179-5376 |
Citations | PageRank | References |
8 | 0.94 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Archdeacon | 1 | 277 | 50.72 |
| C. Paul Bonnington | 2 | 100 | 19.95 |
| Joanna A. Ellis-Monaghan | 3 | 85 | 10.69 |