How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental Results. - Christoph Burnikel; Kurt Mehlhorn; Stefan Schirra (ESA, 1994)

On Degeneracy in Geometric Computations. - Christoph Burnikel; Kurt Mehlhorn; Stefan Schirra (SODA, 1994)

Exact Geometric Computation in LEDA. - Christoph Burnikel; Jochen Könemann; Kurt Mehlhorn; Stefan Näher; Stefan Schirra; Christian Uhrig (SCG, 1995)

Exact computation of Voronoi diagrams and line segment intersections. - Christoph Burnikel (1996)

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (SODA, 1997)

Exact Geometric Predicates Using Cascaded Computation. - Christoph Burnikel; Stefan Funke; Michael Seel (SCG, 1998)

Efficient Exact Geometric Computation Made Easy. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (SCG, 1999)

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. - Christoph Burnikel; Rudolf Fleischer; Kurt Mehlhorn; Stefan Schirra (Algorithmica, 2000)

Interval arithmetic yields efficient dynamic filters for computational geometry. - Hervé Brönnimann; Christoph Burnikel; Sylvain Pion (Discret. Appl. Math., 2001)

Exact Geometric Computation Using Cascading. - Christoph Burnikel; Stefan Funke; Michael Seel (Int. J. Comput. Geom. Appl., 2001)

A Separation Bound for Real Algebraic Expressions. - Christoph Burnikel; Stefan Funke; Kurt Mehlhorn; Stefan Schirra; Susanne Schmitt (Algorithmica, 2009)