when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-7167

Michelucci, Dominique ; Moreau, Jean Michel ; Foufou, Sebti

Robustness and Randomness

Dokument 1.pdf (1,648 KB)


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.

BibTeX - Entry

  author =	{Dominique Michelucci and Jean Michel Moreau and Sebti Foufou},
  title =	{Robustness and Randomness},
  booktitle =	{Reliable Implementation of Real Number Algorithms: Theory and Practice},
  year =	{2006},
  editor =	{Peter Hertling and Christoph M. Hoffmann and Wolfram Luther and Nathalie Revol},
  number =	{06021},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Robustness, interval, randomness, inaccuracy, geometric computation}

Keywords: Robustness, interval, randomness, inaccuracy, geometric computation
Seminar: 06021 - Reliable Implementation of Real Number Algorithms: Theory and Practice
Issue date: 2006
Date of publication: 13.09.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI