Efficient exact arithmetic for computational geometry

Steven Fortune, Christopher J. Van Wyk · Annual Symposium on Computational Geometry (SoCG) · 1993

We experiment with exact integer arithmetic to implement primitives for geometric algorithms. Naive use of exact arithmetic—either modular or multiprecision integer—increases execution time dramatically over the use of floating-point arithmetic. By combining tuned multiprecision integer arithmetic and a floating-point filter based on interval analysis, we can obtain the effect of exact integer arithmetic at a cost close to that of floating-point arithmetic. We describe an experimental expression compiler that conveniently packages our techniques.

Cited by 156 works. doi:10.1145/160985.161015 Open-access PDF

Authors

References