: In this paper we approach the problems of rounding errors in geometric algorithms. Particularly, we are interested in geometric algorithms used by TerraLib
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
: Interval arithmetic was introduced by Ramon Moore [Moo66] in the 1960s as an approach to bound rounding errors in mathematical computation. The theory of interval analysis emerge...
Younis Hijazi, Hans Hagen, Charles D. Hansen, Kenn...
Abstract. We show that any real matrix can be rounded to an integer matrix in such a way that the rounding errors of all row sums are less than one, and the rounding errors of all ...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...