Cutting a polytope

DOI10.1007/BF01265345MaRDI QIDQ1900020zbMATH OpenOpenAlexFDO

Authors William Jockusch, Nagabhushana Prabhu

Publication date 21 August 1996

Published in Geometriae Dedicata (Search for Journal in Brave)

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

zbMATH Keywords

boundary of polytopesconjectureshyperplanesintersectionsurvey

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Review text

Theorem 1. There exist two tetrahedra which can be positioned such that: (1) the origin is in the interior of both the tetrahedra, and (2) no closed half-space whose boundary plane passes through the origin contains more than 5 of the 8 vertices of the two tetrahedra. Theorem 2. (The main theorem) There exists a convex 4-dimensional polytope \(P\) with vertices \(v\) and \(w\) for which no hyperplane containing \(v\) and \(w\) has more than one facet in either closed half-space. This paper, in spite of its brevity, gives a fine survey of conjectures and results concerning how hyperplanes intersect the boundary of polytopes. There is a substantial bibliography.

Recommendations

• Facet-reducing cuts of a convex polytope
• On polytopes cut by flats
• On hyperplanes and polytopes
• scientific article; zbMATH DE number 4022040

Cites work

• Complete subgraphs of the graphs of convex polytopes
• How big can the circuits of a bridge of a maximal circuit be?
• scientific article; zbMATH DE number 3223520 (Why is no real title available?)
• Hyperplane cuts of an n-cube
• On hyperplanes and polytopes
• On the graph structure of convex polyhedra in n-space
• Sections and projections of convex polytopes

Cited in

(18)

• A PTAS for cutting out polygons with lines
• Cyclic polytopes, hyperplanes, and Gray codes
• Applications of cut polyhedra. II
• On the section of a convex polyhedron
• On polytopes cut by flats
• Facet-reducing cuts of a convex polytope
• Developing a tetramonohedron with minimum cut length
• Cutting a Convex Polyhedron Out of a Sphere
• CUTTING OUT POLYGONS WITH A CIRCULAR SAW
• scientific article; zbMATH DE number 4022040 (Why is no real title available?)
• Lifting and separation procedures for the cut polytope
• scientific article; zbMATH DE number 176916 (Why is no real title available?)
• Cutting Polyominos into Equal-Area Triangles
• Dodecahedral slices and polyhedral pieces
• On the 3-Terminal Cut Polyhedron
• Cutting a convex polyhedron out of a sphere
• The best ways to slice a polytope
• On hyperplanes and polytopes

This page was built for publication: Cutting a polytope

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