Robustness and randomness

Dominique Michelucci, Jean Michel Moreau, Sebti Foufou

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

Abstract

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
Pages127-148
Number of pages22
DOIs
StatePublished - Sep 9 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

Other

OtherInternational Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice
CountryGermany
CityDagstuhl Castle
Period1/8/061/13/06

Fingerprint

Computational geometry
Randomness
Computer science
Robustness
Interval Arithmetic
Probabilistic Methods
Computational Geometry
Floating point
Computer Science
Reasoning

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Michelucci, D., Moreau, J. M., & Foufou, S. (2008). Robustness and randomness. In Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers (pp. 127-148). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5045 LNCS). https://doi.org/10.1007/978-3-540-85521-7_8

Robustness and randomness. / Michelucci, Dominique; Moreau, Jean Michel; Foufou, Sebti.

Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. 2008. p. 127-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5045 LNCS).

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

Michelucci, D, Moreau, JM & Foufou, S 2008, Robustness and randomness. in Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5045 LNCS, pp. 127-148, International Seminar on Reliable Implementation of Real Number Algorithms: Theory and Practice, Dagstuhl Castle, Germany, 1/8/06. https://doi.org/10.1007/978-3-540-85521-7_8
Michelucci D, Moreau JM, Foufou S. Robustness and randomness. In Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. 2008. p. 127-148. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-85521-7_8
Michelucci, Dominique ; Moreau, Jean Michel ; Foufou, Sebti. / Robustness and randomness. Reliable Implementation of Real Number Algorithms: Theory and Practice - International Seminar, Revised Papers. 2008. pp. 127-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bef2b386ab56418f90060627100c4ece,
title = "Robustness and randomness",
abstract = "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.",
author = "Dominique Michelucci and Moreau, {Jean Michel} and Sebti Foufou",
year = "2008",
month = "9",
day = "9",
doi = "10.1007/978-3-540-85521-7_8",
language = "English (US)",
isbn = "3540855203",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "127--148",
booktitle = "Reliable Implementation of Real Number Algorithms",

}

TY - GEN

T1 - Robustness and randomness

AU - Michelucci, Dominique

AU - Moreau, Jean Michel

AU - Foufou, Sebti

PY - 2008/9/9

Y1 - 2008/9/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50949133401&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50949133401&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85521-7_8

DO - 10.1007/978-3-540-85521-7_8

M3 - Conference contribution

AN - SCOPUS:50949133401

SN - 3540855203

SN - 9783540855200

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 127

EP - 148

BT - Reliable Implementation of Real Number Algorithms

ER -