Abstract
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in particular the edge lengths and dihedral angles of the polyhedron. Cauchy’s rigidity theorem of 1813 states that the dihedral angles are uniquely determined. Finding them is a significant algorithmic problem which we express as a spherical graph drawing problem. Our main result is that the edge lengths, although not uniquely determined, can be found via linear programming. We make use of significant mathematics on convex polyhedra by Stoker, Van Heijenoort, Gale, and Shepherd.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aigner, M., Ziegler, G.M.: Proofs from the Book, 3rd edn. Springer, Heidelberg (2003)
Alboul, L., Echeverria, G., Rodgrigues, M.: Discrete curvatures and gauss maps for polyhedral surfaces. In: European Workshop on Computational Geometry (2005), http://www.win.tue.nl/EWCG2005/Proceedings/18.pdf
Alexandrov, A.D.: Convex Polyhedra. Springer, Heidelberg (2005)
Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math. 9, 349–359 (1996)
Bobenko, A.I., Izmestiev, I.: Alexandrov’s theorem, weighted delaunay triangulations, and mixed volumes (2006), http://www.citebase.org/
Cromwell, P.R.: Polyhedra. Cambridge University Press, Cambridge (1997)
Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Computational Geometry Theory and Applications 8, 123–137 (1997)
Demaine, E.D., Erickson, J.: Open problems on polytope reconstruction (July 1999), http://theory.csail.mit.edu/~edemaine/papers/PolytopeReconstruction/
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press, Cambridge (2007)
Devillers, O., Liotta, G., Preparata, F., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Computational Geometry: Theory and Applications 11, 187–208 (1998)
Gale, D.: Irreducible convex sets. In: Proc. International Congress of Mathematicians, vol. II, pp. 217–218. North-Holland, Amsterdam (1954)
Garg, A.: New results on drawing angle graphs. Computational Geometry Theory and Applications 9, 43–82 (1998)
Van Heijenoort, J.: On locally convex manifolds. Communications on Pure and Applied Mathematics 5, 223–242 (1952)
Kaibel, V., Pfetsch, M.E.: Some algorithmic problems in polytope theory. Algebra, Geometry, and Software Systems 23–47 (2003)
Lucier, B.: Unfolding and reconstructing polyhedra. Master’s thesis, David R. Cheriton School of Computer Science, University of Waterloo (2006)
McMullen, P.: Representations of polytopes and polyhedral sets. Geometriae Dedicata 2, 83–99 (1973)
Mehlhorn, K., Näher, S., Seel, M., Schilz, T., Schirra, S., Uhrig, C.: Checking geometric programs or verification of geometry structures. Computational Geometry: Theory and Applications 12, 85–103 (1999)
Meyer, W.: Indecomposable polytopes. Transactions of the American Mathematical Society 190, 77–86 (1974)
O’Rourke, J.: Computational geometry column. SIGACT News 38(2) (to appear)
Rybnikov, K.A.: Fast verification of convexity of piecewise-linear surfaces. CoRR, cs.CG/0309041 (2003), http://arxiv.org/abs/cs.CG/0309041
Sabitov, I.K.: The volume as a metric invariant of polyhedra. Discrete and Computational Geometry 20(4), 405–425 (1998)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
Sheffer, A., de Sturler, E.: Parameterization of faceted surfaces for meshing using angle based flattening. Engineering with Computers 17(3), 326–337 (2001)
Sheffer, A., Gotsman, C., Dyn, N.: Robust spherical parameterization of triangular meshes. Computing 72, 185–193 (2004)
Shephard, G.C.: Decomposable convex polyhedra. Mathematika 10, 89–95 (1963)
Stoker, J.J.: Geometrical problems concering polyhedra in the large. Communications on Pure and Applied Mathematics 11, 119–168 (1968)
Vijayan, G.: Geometry of planar graphs with angles. In: Proc. 2nd Annual ACM Symposium on Computational Geometry, pp. 116–124 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biedl, T., Lubiw, A., Spriggs, M. (2007). Cauchy’s Theorem and Edge Lengths of Convex Polyhedra. In: Dehne, F., Sack, JR., Zeh, N. (eds) Algorithms and Data Structures. WADS 2007. Lecture Notes in Computer Science, vol 4619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73951-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-73951-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73948-7
Online ISBN: 978-3-540-73951-7
eBook Packages: Computer ScienceComputer Science (R0)