A Toroidal Maxwell-Cremona-Delaunay Correspondence

by   Jeff Erickson, et al.

We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A torus graph G is equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors incident to each vertex of G sum to zero. (2) A torus graph G is reciprocal if there is a geodesic embedding of the dual graph G^* on the same flat torus, where each edge of G is orthogonal to the corresponding dual edge in G^*. (3) A torus graph G is coherent if it is possible to assign weights to the vertices, so that G is the (intrinsic) weighted Delaunay graph of its vertices. The classical Maxwell-Cremona correspondence and the well-known correspondence between convex hulls and weighted Delaunay triangulations imply that the analogous concepts for plane graphs (with convex outer faces) are equivalent. Indeed, all three conditions are equivalent to G being the projection of the 1-skeleton of the lower convex hull of points in ℝ^3. However, this three-way equivalence does not extend directly to geodesic graphs on flat tori. On any flat torus, reciprocal and coherent graphs are equivalent, and every reciprocal graph is equilibrium, but not every equilibrium graph is reciprocal. We establish a weaker correspondence: Every equilibrium graph on any flat torus is affinely equivalent to a reciprocal/coherent graph on some flat torus.


page 7

page 8

page 9

page 10

page 11

page 13

page 16

page 18


A Note on Toroidal Maxwell-Cremona Correspondences

We explore toroidal analogues of the Maxwell-Cremona correspondence. Eri...

Addendum to: Edge-Unfolding Nearly Flat Convex Caps

This addendum to [O'R17] establishes that a nearly flat acutely triangul...

Realization and Connectivity of the Graphs of Origami Flat Foldings

We investigate the graphs formed from the vertices and creases of an ori...

A Universal Triangulation for Flat Tori

A result due to Burago and Zalgaller states that every orientable polyhe...

Edge-Unfolding Nearly Flat Convex Caps

This paper proves a conjecture from [LO17]: A nearly flat, acutely trian...

Simplifying Activity-on-Edge Graphs

We formalize the simplification of activity-on-edge graphs used for visu...

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity

The C-Planarity problem asks for a drawing of a clustered graph, i.e., a...

Please sign up or login with your details

Forgot password? Click here to reset