1. C. Burnikel, R. Fleischer, K. Mehlhorn, and S. Schirra. Exact efficient computational geometry made easy. In Proceedings of the 15th Annual Symposium on Computational Geometry (SCG’99), pages 341–350, 1999.
http://www.mpi-sb.mpg.de/~mehlhorn/ftp/egcme.ps
.
2. C. Burnikel, R. Fleischer, K. Mehlhorn, S. Schirra. A strong and easily computable separation bound for arithmetic expressions involving radicals. Algorithmica, 27:87–99, 2000.
3. Lect Notes Comput Sci;C. Burnikel,1994
4. C. Burnikel, K. Mehlhorn, and S. Schirra. The LEDA class real number. Technical Report MPI-I-96-1-001, Max-Planck-Institut für Informatik, Saarbrücken, 1996.
5. J.F. Canny. The Complexity of Robot Motion Planning. The MIT Press, 1987.