Polynomial representations of polyhedra
From MaRDI portal
Recommendations
- The representation of polyhedra by polynomial inequalities
- Polynomial inequalities representing polyhedra
- scientific article; zbMATH DE number 5956571
- Representing simple d-dimensional polytopes by d polynomials
- scientific article; zbMATH DE number 1390133
- scientific article; zbMATH DE number 3943559
- Polyhedrality and decomposition
- scientific article; zbMATH DE number 1560219
- scientific article; zbMATH DE number 2070258
- Polynomial approximation on polytopes
Cited in
(25)- On minimal generators for semi-closed polyhedra
- A representation of generalized convex polyhedra and applications
- Representing the sporadic Archimedean polyhedra as abstract polytopes
- Representability of convex sets by analytical linear inequality systems.
- Note on prime representations of convex polyhedral sets
- Polynomial icosahedral invariants
- scientific article; zbMATH DE number 146863 (Why is no real title available?)
- Invariance and efficiency of convex representations
- The linear inequalities set representation of Minkovski's sum for two polyhedrons
- scientific article; zbMATH DE number 1860737 (Why is no real title available?)
- Minimal polynomial descriptions of polyhedra and special semialgebraic sets
- A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
- Hyperbolization of polyhedra
- Description of polygonal regions by polynomials of bounded degree
- Representing simple d-dimensional polytopes by d polynomials
- The analysis and the representation of balanced complex polytopes in 2D
- Polyhedral representation conversion up to symmetries
- Notes on the algebra and geometry of polynomial representations
- scientific article; zbMATH DE number 5956571 (Why is no real title available?)
- A method of transferring polyhedron between the intersection-form and the sum-form
- Automata-based symbolic representations of polyhedra
- Polyhedra related to integer-convex polynomial systems
- Representation of Sets of Lattice Points
- Polyhedral representation of discrete Morse functions
- Three-dimensional polyhedra can be described by three polynomial inequalities
This page was built for publication: Polynomial representations of polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468441)