2,963 research outputs found
On the Development of the Intersection of a Plane With a Polytope
Define a “slice” curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy\u27s arm lemma to permit nonconvex “openings” of a planar convex chain
Recommended from our members
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems. Describing as well as identifying these inequalities will help in the efficiency of the LP-based cutting plane methods. In this report, we review classes of inequalities that partially described zero-one poly topes such as the 0-1 knapsack polytope, the set packing polytope and the travelling salesman polytope. Facets or valid inequalities derived from the 0-1 knapsack and the set packing polytopes are algorithmically identifie
Existence and uniqueness theorem for convex polyhedral metrics on compact surfaces
We state that any constant curvature Riemannian metric with conical
singularities of constant sign curvature on a compact (orientable) surface
can be realized as a convex polyhedron in a Riemannian or Lorentzian)
space-form. Moreover such a polyhedron is unique, up to global isometries,
among convex polyhedra invariant under isometries acting on a totally umbilical
surface. This general statement falls apart into 10 different cases. The cases
when is the sphere are classical.Comment: Survey paper. No proof. 10 page
Pruning Algorithms for Pretropisms of Newton Polytopes
Pretropisms are candidates for the leading exponents of Puiseux series that
represent solutions of polynomial systems. To find pretropisms, we propose an
exact gift wrapping algorithm to prune the tree of edges of a tuple of Newton
polytopes. We prefer exact arithmetic not only because of the exact input and
the degrees of the output, but because of the often unpredictable growth of the
coordinates in the face normals, even for polytopes in generic position. We
provide experimental results with our preliminary implementation in Sage that
compare favorably with the pruning method that relies only on cone
intersections.Comment: exact, gift wrapping, Newton polytope, pretropism, tree pruning,
accepted for presentation at Computer Algebra in Scientific Computing, CASC
201
A convexity theorem for real projective structures
Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider
a real projective manifold M which is obtained by gluing together the polytopes
in P along their facets in such a way that the union of any two adjacent
polytopes sharing a common facet is convex. We prove that the real projective
structure on M is (1) convex if P contains no triangular polytope, and (2)
properly convex if, in addition, P contains a polytope whose dual polytope is
thick. Triangular polytopes and polytopes with thick duals are defined as
analogues of triangles and polygons with at least five edges, respectively.Comment: 61 pages, 19 figure
- …