Polytope Offsets and Straight Skeletons in 3D

We give a concise definition of mitered offset surfaces for nonconvex polytopes in $${\mathbbm {R}}^3$$R3, along with a proof of existence and a discussion of basic properties. These results imply the existence of 3D straight skeletons for general ...

The cut polytope P"c(G) of a graph G is the convex hull of the incidence vectors of the edge sets of all cuts of G. We give a sufficient condition for an inequality defining a facet of P"c(G) to define a facet of the cut polytope of a graph containing G ...

The cut polytopePC(G) of a graphG=(V, E) is the convex hull of the incidence vectors of all edge sets of cuts ofG. We show some classes of facet-defining inequalities ofPC(G). We describe three methods with which new facet-defining inequalities ofPC(G) ...