Advertisement

Discrete & Computational Geometry

, Volume 2, Issue 1, pp 49–64 | Cite as

A criterion for the affine equivalence of cell complexes inR d and convex polyhedra inRd+1

  • Franz Aurenhammer
Article

Abstract

A criterion is given that decides, for a convex tilingC ofR d , whetherC is the projection of the faces in the boundary of some convex polyhedronP inRd+1. Its applicability is restricted neither by the properties nor by the dimension ofC. It turns out to be conceptually simpler than other criteria and allows the easy examination of various classes of cell complexes. In addition, the criterion is constructive, that is, it can be used to constructP provided it exists.

Keywords

Simplicial Complex Voronoi Diagram Discrete Comput Geom Cell Complex Convex Polyhedron 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    P. F. Ash and E. D. Bolker, Generalized Dirichlet Tesselations, Manuscript, Department of Computer Science, University of Massachusetts, Boston, 1982.zbMATHGoogle Scholar
  2. 2.
    F. Aurenhammer, Power diagrams: properties, algorithms, and applications. To appear inSIAM J. Comput.Google Scholar
  3. 3.
    F. Aurenhammer,A New Duality Result Concerning Voronoi Diagrams, 21–30, Lecture Notes in Computer Science, Vol. 226, 1986.Google Scholar
  4. 4.
    F. Aurenhammer, Recognizing polytopical cell complexes and constructing projection polyhedra. Submitted for publication.Google Scholar
  5. 5.
    W. Blaschke,Vorlesungen über Differentialgeometrie III, Springer-Verlag, Berlin, 1929.zbMATHGoogle Scholar
  6. 6.
    R. J. Canham, Arrangements of Hyperplanes in Projective and Euclidean Spaces, Ph.D. thesis, University of East Anglia, UK, 1971.Google Scholar
  7. 7.
    R. Connelly and D. W. Henderson, A convex 3-complex not simplicially isomorphic to a strictly convex complex,Math. Proc. Cambridge Philos. Soc. 88 (1980), 299–304.zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    H. S. M. Coxeter, The classification of zonohedra by means of projective diagrams,J. Math. Pures Appl. 41 (1962), 137–156.zbMATHMathSciNetGoogle Scholar
  9. 9.
    H. Crapo and W. Whiteley, Stressed Frameworks and Projected Polytopes, Groupe de Recherche Topologie Structurale, University of Montreal, 1978 (reprint).Google Scholar
  10. 10.
    C. Davis, The Set of Nonlinearity of a Convex Piecewise-Linear Function, Institute for Advanced Study, American Mathematical Society, Providence, RI, 1959.Google Scholar
  11. 11.
    H. Edelsbrunner and H. A. Maurer, Finding extreme points in three dimensions and solving the post-office problem in the plane, IPL21 (1985), 39–47.zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    F. Harary,Graph theory, Addison-Wesley, Reading, MA, 1982.Google Scholar
  13. 13.
    J. C. Maxwell, On reciprocal figures, frames, and diagrams of forces,Phil. Mag. Ser. 4,27 (1864), 250–261.Google Scholar
  14. 14.
    I. Paschinger, Konvexe Polytope and Dirichletsche Zellenkomplexe, Dissertation, Inst. für Math., University of Salzburg, Austria, 1982.zbMATHGoogle Scholar
  15. 15.
    G. C. Shephard, Spherical complexes and radial projections of polytopes,Israel J. Math. 9 (1971), 257–262.zbMATHMathSciNetCrossRefGoogle Scholar
  16. 16.
    E. Steinitz, Polyeder und Raumeinteilungen, Enzyklopaedie der Math. Wiss. III AB 12, Leipzig, 1916.Google Scholar
  17. 17.
    F. Supnick, On the perspective deformation of polyhedra,Ann. Math. 49 (1948), 714–730;53 (1953), 551–555.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1987

Authors and Affiliations

  • Franz Aurenhammer
    • 1
    • 2
  1. 1.Institutes for Information ProcessingTechnical University of GrazAustria
  2. 2.Austrian Computer SocietyGrazAustria

Personalised recommendations