The Bernstein Basis and its Applications in Solving Geometric Constraint Systems

Abstract : This article reviews the properties of Tensorial Bernstein Basis (TBB) and its usage, with interval analysis, for solving systems of nonlinear, univariate or multivariate equations resulting from geometric constraints. TBB are routinely used in computerized geometry for geometric modelling in CAD-CAM, or in computer graphics. They provide sharp enclosures of polynomials and their derivatives. They are used to reduce domains while preserving roots of polynomial systems, to prove that domains do not contain roots, and to make existence and uniqueness tests. They are compatible with standard preconditioning methods and fit linear program- ming techniques. However, current Bernstein-based solvers are limited to small algebraic systems. We present Bernstein polytopes and show how combining them with linear programming allows us to solve larger systems as well. The article also gives a generalization of Bernstein polytopes to higher degrees and a comparison of polytopes-based versus TBB-based polynomial bounds.
Type de document :
Article dans une revue
Reliable Computing, Springer Verlag, 2012, 17, pp.192--208
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00783999
Contributeur : Dominique Michelucci <>
Soumis le : samedi 2 février 2013 - 16:33:48
Dernière modification le : samedi 14 juillet 2018 - 01:05:33

Identifiants

  • HAL Id : hal-00783999, version 1

Collections

LE2I | ICB

Citation

Dominique Michelucci, Foufou Sebti. The Bernstein Basis and its Applications in Solving Geometric Constraint Systems. Reliable Computing, Springer Verlag, 2012, 17, pp.192--208. 〈hal-00783999〉

Partager

Métriques

Consultations de la notice

110