A strong and easily computable separation bound for arithmetic expressions involving radicals

Algorithmica (New York)

Volumn 27, Issue 1, 2000, Pages 87-99

  Burnikel, C ^a   Fleischer, R ^a   Mehlhorn, K ^a   Schirra, S ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Exact geometric computation; Separation bound

Indexed keywords

EID: 0012101574     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010005     Document Type: Article

References (17)

1. IEEE Standard 754-1985 for Binary Floating-Point Arithmetic. Reprinted in SIGPLAN, 22(2):9-25, 1987.
2. C. Burnikel. Exact Computation of Voronoi Diagrams and Line Segment Intersections. Ph.D. thesis, Universität des Saarlandes, 1996.
3. C. Burnikel, K. Mehlhorn, and S. Schirra. How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. In Proceedings of ESA '94, pages 227-239. LNCS 855, Springer-Verlag, Berlin, 1994.
4. C. Burnikel, K. Mehlhorn, and S. Schirra. The LEDA Class Real Number. Technical Report MPM-96-1-001, Max-Planck-Institut für Informatik, Saarbrücken, January 1996. see http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1996-1-001.
5. J.F. Canny. The Complexity of Robot Motion Planning. The MIT Press, Cambridge, MA, 1987.
6. T. Dubé and C.K. Yap. A Basis for Implementing Exact Geometric Algorithms. Manuscript, October 1993.
7. E. Hecke, Vorlesungen über die Theorie der Algebraischen Zahlen, 2nd edition. Chelsea, New York, 1970.
8. J.W. Hong. Proving by Example and Gap Theorem. In Proceedings of the 28th Symposium on the Foundations of Computer Science (FOCS '87), 1987.
9. G. Liotta, P.P. Preparata, and R. Tamassia. Robust Proximity Queries in Implicit Voronoi Diagrams. Technical Report RI02912-1910, Center for Geometric Computing, Department of Computer Science, Brown University, Providence, RI, May 1996.
10. R. Loos. Computing in Algebraic Extensions. In B. Buchberger, O.E. Collins, and R. Loos, editors, Computer Algebra, pages 173-187. Springer-Verlag, Berlin, 1982.
11. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, 1999, see http : / /www.mpi-sb.mpg.de/LEDA/leda.html.
12. M. Mignotte. Identification of Algebraic Numbers. Journal of Algorithms, 3(3), September 1982.
13. M. Mignotte. Mathematics for Computer Algebra. Springer-Verlag, Berlin, 1992.
14. B.L. van der Waerden. Algebra, volumes 1 & 2. Ungar, New York, 1970.
15. C.K. Yap. Towards Exact Geometric Computation. In Proceedings of CCCG '93, pages 405-419, 1993.
16. C.K. Yap. Fundamental Problems in Algorithmic Algebra. Princeton University Press, Princeton, NJ (to appear).
17. C.K. Yap and T. Dubé. The Exact Computation Paradigm. In D.Z. Du and F. Hwang, editors, Computing in Euclidean Geometry, 2nd edition, pages 452-492. World Scientific, Singapore, 1995.