Abstract
Polyhedra are basic three-dimensional objects, appearing at many levels in the algorithms of computational geometry, computer-aided design, computer vision, and robotics. What data can we use to describe a polyhedron in 3-space? What independent choices can we make when constructing a polyhedron? These are two aspects of a single question investigated in this article. The answers depend both on the level of geometry we are using (Euclidean, similarity, projective, combinatorial) and on the source of the geometric data. The constructions and representations are translated from classical and modern geometric practice. Classical theorems and techniques of Cauchy, Steinitz, Maxwell, Minkowski, and Alexandrov are transferred to this setting. Other recent geometric results are also described and a number of unsolved problems are raised.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Alexandrov, A.D.: 1958,Konvexe Polyeder, (German translation of the Russian edition), Adak.-Verlag, Berlin.
Asimow, L. and Roth, B.: 1978, Rigidity of graphs,Trans. Amer. Math. Soc. 245, 279–289.
Baracs, J.: 1988, Spatial perception and creativity; in M. Senechal and G. Fleck (eds.),Shaping Space: A Polyhedral Approach, Birkhauser, Boston, pp. 118–132.
Barnette, B. and Grünbaum, B.: 1969, On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs, inMany Facets of Graph Theory, Lecture Notes in Math. 110, Springer-Verlag, New York, pp. 27–40.
Bench-Capon, T.J.M.: 1990,Knowledge Representations: An Approach to Artificial Intelligence, The APIC Series 32, Academic Press, London, San Diego.
Bruggesser, H. and Mani, P.: 1971, Shellable decompositions of cells and spheres, inMath. Scand. 29, 197–205.
Cauchy, A.: 1831, Deuxiéme memoire sur les polygons,J. École Polytechnique, XVIe Cahier, 87–98.
Crapo, H.: 1984, Concurrence geometries,Adv. in Math. 54, 278–301.
Crapo, H. and Whiteley, W.: 1993, Plane stresses and projected polyhedra I: the basic pattern,Structural Topology 20, 55–78.
Crippen, G.M. and Havel, T.F.: 1988,Distance Geometry and Molecular Conformation, Research Studies Press, Somerset, England.
Dehn, M.: 1914, Über die Starrheit konvexer Polyeder,Math. Anal. 77, 466–473.
Fogelsanger, A.: 1988, Triangulated minimal 2-cycles are generically rigid, PhD Thesis, Department of Mathematics, Cornell University, Ithaca, New York.
Gluck, H.: 1975, Almost all simply connected surfaces are rigid, inGeometric Topology, Lecture Notes in Math. 438, Springer-Verlag, Berlin, pp. 225–239.
Karcher, H.: 1968, Remarks on polyhedra with given dihedral angles,Com. Pure Appl. Math. 21, 169–174.
Laman, G.: 1970, On graphs and the rigidity of plane skeletal structures,J. Eng. Math. 4, 331–340.
Lyusternik, L.A.: 1956,Convex Figures and Polyhedra, English translation, D.C. Heath, Boston.
Maxwell, J.C.: 1864, On reciprocal figures and diagrams of forces,Phil. Mag. Series 4 27, 250–261.
Minkowski, H.: 1897, Allgemeine Lehrsätz über die konvexe Polyeder,Nachr. Ges. Wiss. Götingen 1987, pp. 198–219.
Rivin, I.: 1992, Some applications of the hyperbolic volume formula of Lobachevsky and Milnor, Preprint, Dept. of Mathematics, Princeton University, Princeton, NJ.
Shephard, G.C.: 1963, Decomposible convex polyhedra,Mathematika 11, 89–95.
Steinitz, E. and Rademacher, H.: 1934,Vorlesungen über die Theorie der Polyeder, Springer-Verlag, Berlin.
Stoker, J.J.: 1968, Geometric problems concerning polyhedra in the large,Com. Pure Appl. Math. 21, 119–168.
Sugihara, K.: 1986,Machine Interpretation of Line Drawings, MIT Press, Cambridge, Mass.
Tay, T.-S. and Whiteley, W.: 1985, Generating all isostatic frameworks,Structural Topology 11, 21–69.
White, N. and Whiteley, W.: 1984, The algebraic geometry of stresses in frameworks,SIAM J. Algebraic Discrete Meth. 4, 481–511.
Whiteley, W.: 1982, Motions, stresses and projected polyhedra,Structural Topology 7, 13–38.
Whiteley, W.: 1983, Infinitesimally rigid polyhedra I: statics of frameworks,Trans. Amer. Math. Soc. 285, 431–465.
Whiteley, W.: 1986, Two algorithms for polyhedral pictures,Proc. 2nd ACM Conf. Computational Geometry, pp. 142–149.
Whiteley, W.: 1987(a), Parallel redrawing of configurations in 3-space, Preprint.
Whiteley, W.: 1987(b), Infinitesimally rigid polyhedra II: modified spherical frameworks,Trans. Amer. Math. Soc. 306, 115–139.
Whiteley, W.: 1988(a), Some matroids on hypergraphs with applications to scene analysis and geometry,Discrete Comp. Geom. 4, 75–95.
Whiteley, W.: 1988(b), Problems on the realizability and rigidity of polyhedra, in M. Senechal and G. Fleck (eds.),Shaping Space: A Polyhedral Approach, Birkhauser, Boston, pp. 256–257.
Whiteley, W.: 1991(a), Vertex splitting in isostatic frameworks,Structural Topology 16, 23–30.
Whiteley, W.: 1991(b), Weavings, sections and projections of spherical polyhedra,Discrete Appl. Math. 332, 275–293.
Whiteley, W.: 1992, Matroids and rigidity, in Neil White (ed.),Matroid Applications, Encyclopedia of Mathematics, Cambridge University Press, pp. 1–53.
Whiteley, W.: 1993(a), Representing geometric configurations, in D. Kueker and C. Smith (eds),Learning and Geometry, Progress in Automation and Informations Systems, Springer-Verlag, to appear.
Whiteley, W.: 1993(b), Determination of Spherical Polyhedra, to appear.
Wu Wen-tsün: 1984, Basic principles of mechanical theorem-proving in elementary geometries,J. Systems Sci. Math. Sci. 4, 207–235.
Author information
Authors and Affiliations
Additional information
This work was supported, in part, by grants from FCAR (Québec) and NSERC (Canada).
Rights and permissions
About this article
Cite this article
Whiteley, W. How to describe or design a polyhedron. J Intell Robot Syst 11, 135–160 (1994). https://doi.org/10.1007/BF01258299
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01258299