Hopefully you remember the post I made back in Oct. 2007 about Rigorous Geometry. It turns out the CGAL project has a whole page devoted to this subject see CGAL/Philosophy. I suggest you read their thoughts on the subject since they’ve devoted considerable time to the problem.

Their solution to simplify considerably is to compute with numbers of arbitrary precision. They do this using either the GNU Multiple Precision Library or their own internal code.

I’ve decided to try implementing my project to solve Tanagram puzzles using the CGAL library. The downside is that CGAL is written in C++.