@techreport{Burnikel98-1-027,
TITLE = {Delaunay graphs by divide and conquer},
AUTHOR = {Burnikel, Christoph},
LANGUAGE = {eng},
NUMBER = {MPI-I-1998-1-027},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {1998},
DATE = {1998},
ABSTRACT = {This document describes the LEDA program dc_delaunay.c for computing Delaunay graphs by the divide-and-conquer method. The program can be used either with exact primitives or with non-exact primitives. It handles all cases of degeneracy and is relatively robust against the use of imprecise arithmetic. We use the literate programming tool noweb by Norman Ramsey.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}