Description of polygonal regions by polynomials of bounded degree

DOI10.1007/s00605-010-0224-xzbMath1264.14074arXiv1002.0941OpenAlexW2139815214MaRDI QIDQ621777

Christian Bey, Gennadiy Averkov

Publication date: 28 January 2011

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.0941

zbMATH Keywords

semi-algebraic setpolygonpolynomialgray codetheorem of Bröcker and Scheiderer

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Semialgebraic sets and related spaces (14P10) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on the algebra and geometry of polynomial representations
• The representation of polyhedra by polynomial inequalities
• Binary Gray codes with long bit runs
• Polynomial inequalities representing polyhedra
• Three-dimensional polyhedra can be described by three polynomial inequalities
• Polynomial representations of polyhedra
• A Survey of Combinatorial Gray Codes
• Minimal polynomial descriptions of polyhedra and special semialgebraic sets

This page was built for publication: Description of polygonal regions by polynomials of bounded degree