Cell decomposition of polytopes by bending

DOI10.1007/BF02787218MaRDI QIDQ1120831zbMATH OpenFDO

Authors Jacob E. Goodman, János Pach

Publication date 1988

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02787218

zbMATH Keywords

cell decompositionconvex d-polytopetriangulation

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)

Review text

Let P be a convex d-polytope and H a hyperplane meeting P but not any vertex of P. It is shown that a cell decomposition of P exists consisting of the convex hulls of pairs of faces of P, such that the faces in each pair are separated by H and their dimensions sum to d-1. To prove this result the authors introduce the idea of ``bending a polytope around hyperplane, yielding a \(d+1\)-polytope, which, when flattened back into d-space, gives rise to the sought cell decomposition. A similar technique shows that the region between two convex d-polytopes (either disjoint or one contained in the other) may be likewise cell- decomposed by using pairs of faces, one of each polytope.

Recommendations

• Stabilizing cell-like decompositions of polyhedra
• Decomposition of cellular balleans
• Decomposability of polytopes and polyhedra
• scientific article; zbMATH DE number 3930776
• Decomposability of polytopes
• scientific article; zbMATH DE number 5542507
• Decomposing the boundary of a nonconvex polyhedron
• Decomposing the boundary of a nonconvex polyhedron
• scientific article; zbMATH DE number 822010

Cites work

• Decompositions of Rational Convex Polytopes
• scientific article; zbMATH DE number 878328 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• Hyperplane sections of polyhedra, toroidal manifolds, and discrete groups in Lobachevskij space
• On hyperplanes and polytopes
• On polytopes cut by flats
• Spherical complexes and radial projections of polytopes
• Triangulations of Oriented Matroids and Convex Polytopes

Cited in

(6)

• On polytopes cut by flats
• Facet-reducing cuts of a convex polytope
• Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
• Canonical decomposition of a difference of convex sets
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• On hyperplanes and polytopes

This page was built for publication: Cell decomposition of polytopes by bending

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120831)