Linear Programming for Bernstein Based Solvers

DOI10.1007/978-3-642-21046-4_8zbMath1302.68126OpenAlexW1503616456MaRDI QIDQ3003233

Dominique Michelucci, Christoph Fünfzig

Publication date: 26 May 2011

Published in: Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21046-4_8

zbMATH Keywords

geometric constraint solvingsubdivision solverBernstein polytopetensorial Bernstein basis

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Linear Programming for Bernstein Based Solvers