A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming - ICFP '01
Algorithms in Computational Geometry and Computer Aided Design are often developed for the Real RAM model of computation, which assumes exactness of all the input arguments and operations. In practice, however, the exactness imposes tremendous limitations on the algorithms -even the basic operations become uncomputable, or prohibitively slow. When the computations of interest are limited to determining the sign of polynomial expressions over floatingpoint numbers, faster approaches aredoi:10.1145/507660.507662 fatcat:ez7dtribyfga3jqny2dhmu6tzq