Geometric Software: Robustness Issues and Model of Computation

  • André Lieutier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)


A significant proportion of algorithms for solid modelling and, more generally, algorithms based on geometric representations suffer of robustness problems. In fact, the impacted algorithms reveal to have numerical computations deeply nested with combinatorial computations. Traditionally, the numerical part of the computation is implemented in double precision floating-point numbers and generally leads to small rounding errors.


Numerical Part Modular Arithmetic Persistent Homology Robustness Issue Combinatorial Part 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • André Lieutier
    • 1
    • 2
  1. 1.Dassault Systémes ProvenceAix-en-Provence, Cedex 2France
  2. 2.Modélisation Géométrique et Approximation, Institut d’Informatique et Mathématiques Appliqueées de GrenobleGrenoble, Cedex 9France

Personalised recommendations