Robustness and randomness in reliable implementation of real number algorithms : theory and practise - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Robustness and randomness in reliable implementation of real number algorithms : theory and practise

D Michelucci
  • Fonction : Auteur
Sebti Foufou

Résumé

The study of robustness problems for computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discusses approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust.

Dates et versions

hal-01511446 , version 1 (21-04-2017)

Identifiants

Citer

D Michelucci, Jean-Michel Moreau, Sebti Foufou. Robustness and randomness in reliable implementation of real number algorithms : theory and practise. International Seminar Dagstuhl Castle, Jan 2006, Wadern, Germany. pp.127-148, ⟨10.1007/978-3-540-85521-7_8⟩. ⟨hal-01511446⟩
94 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More