A scheme is presented and software is documented for representing as integers input decimal numbers that have been stored in a computer as double precision floating point numbers and for carrying out multiplications, additions and subtractions based on these numbers in an exact manner. The input decimal numbers must not have more than nine digits to the left of the decimal point. The decimal fractions of their floating point representations are all first rounded off at a prespecified location, a location no more than nine digits away from the decimal point. The number of digits to the left of the decimal point for each input number besides not being allowed to exceed nine must then be such that the total number of digits from the leftmost digit of the number to the location where round-off is to occur does not exceed fourteen.
[1]
Chee-Keng Yap,et al.
Towards Exact Geometric Computation
,
1997,
Comput. Geom..
[2]
Kurt Mehlhorn,et al.
LEDA: a platform for combinatorial and geometric computing
,
1997,
CACM.
[3]
Chee-Keng Yap,et al.
A core library for robust numeric and geometric computation
,
1999,
SCG '99.
[4]
Christopher J. Van Wyk,et al.
Efficient exact arithmetic for computational geometry
,
1993,
SCG '93.
[5]
Javier Bernal.
REGTET: A Program for Computing Regular Tetrahedralizations
,
2001,
International Conference on Computational Science.
[6]
Christopher J. Van Wyk,et al.
Static analysis yields efficient exact integer arithmetic for computational geometry
,
1996,
TOGS.