Robustness and randomness

Dominique Michelucci, Jean Michel Moreau, Sebti Foufou

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationReliable Implementation of Real Number Algorithms
Subtitle of host publicationTheory and Practice - International Seminar, Revised Papers
Number of pages22
StatePublished - 2008
EventInternational Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice - Dagstuhl Castle, Germany
Duration: Jan 8 2006Jan 13 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5045 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherInternational Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice
CityDagstuhl Castle

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Robustness and randomness'. Together they form a unique fingerprint.

Cite this