Robustness and Randomness

Authors Dominique Michelucci, Jean Michel Moreau, Sebti Foufou

Thumbnail PDF


  • Filesize: 1.6 MB
  • 23 pages

Document Identifiers

Author Details

Dominique Michelucci
Jean Michel Moreau
Sebti Foufou

Cite AsGet BibTex

Dominique Michelucci, Jean Michel Moreau, and Sebti Foufou. Robustness and Randomness. In Reliable Implementation of Real Number Algorithms: Theory and Practice. Dagstuhl Seminar Proceedings, Volume 6021, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Robustness problems of 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 discussed 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.
  • Robustness
  • interval
  • randomness
  • inaccuracy
  • geometric computation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail