Abstract
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.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lieutier, A. (2005). Geometric Software: Robustness Issues and Model of Computation. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_36
Download citation
DOI: https://doi.org/10.1007/11494645_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)