hide
Free keywords:
-
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.