MPI-I-98-1-027. October 1998, 24 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
1767 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |