Space Structures and the Crossing Number of Their Graphs*

摘要

In this paper, theorems are proved that relate the degree of staticaI indeterminacy of space structures to their planar topological properties. An algorithm is developed for suboptimal layout of an arbitrary space structure in a plane, and a lower bound is established to the crossing number of its graph model.