Your search returned the following 14 documents:

14. A Separation Bound for Real Algebraic Expressions
    Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, and Susanne Schmitt
    Algorithmica 55 (1): 14-28, 2009
    
13. The LEDA class real number -- extended version
    Stefan Funke, Kurt Mehlhorn, Susanne Schmitt, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
    Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363110-01, Report
    
12. A Separation Bound for Real Algebraic Expressions
    Christoph Burnikel, Stefan Funke, Kurt Mehlhorn, Stefan Schirra, and Susanne Schmitt
    In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), Aarhus, Denmark, August, 28-31, 2001, 254-265
    
    
11. Exact geometric computation using Cascading
    Christoph Burnikel, Stefan Funke, and Michael Seel
    International Journal of Computational Geometry & Applications 11 (3): 245-266, 2001
    
10. Interval arithmetic yields efficient dynamic filters for computational geometry
    Hervé Brönnimann, Christoph Burnikel, and Sylvain Pion
    Discrete Applied Mathematics 109 (1/2): 25-47, 2001
    
9. A strong and easily computable separation bound for arithmetic expressions involving radicals
   Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
   Algorithmica 27 (1): 87-99, 2000
   
   
8. Efficient exact geometric computation made easy
   Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, and Stefan Schirra
   In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), Miami Beach, USA, June, 13- June, 16, 1999, 341-350
   
   
7. Exact Geometric Predicates using Cascaded Computation
   Christoph Burnikel, Stefan Funke, and Michael Seel
   In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, USA, June, 7-10, 1998, 175-183
   
6. Interval analysis yields efficient dynamic filters for computational geometry
   Hervé Brönnimann, Christoph Burnikel, and Sylvain Pion
   In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, Minnesota, June 7-10, 1998, 1998, 165-174
   
5. A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
   Kurt Mehlhorn, Christoph Burnikel, Rudolf Fleischer, and Stefan Schirra
   In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), New Orleans, USA, January, 5-7, 1997, 702-709
   
4. Exact Computation of Voronoi Diagrams and Line Segment Intersections
   Christoph Burnikel
   Doctoral dissertation, Universität des Saarlandes, 1996
   
3. Exact Geometric Computation in LEDA
   Christoph Burnikel, Jochen Könemann, Kurt Mehlhorn, Stefan Näher, Stefan Schirra, and Christian Uhrig
   In: 11th ACM Symposium on Computational Geometry (SCG95), Vancouver, British Columbia, Canada, June, 5th - 7th, 1995, C18-C19
   
   
2. How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results
   Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra
   In: Algorithms (ESA-94) : 2nd annual European symposium, Utrecht, The Netherlands, September 26-28, 1994, 1994, 227-239
   
   
1. On degeneracy in geometric computations
   Christoph Burnikel, Kurt Mehlhorn, and Stefan Schirra
   In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, Arlington, USA, 1994, 16-23
   [PDF: Download: DegeneracyGeometry.pdf]