MPI-INF/SWS Research Reports 1991-2021
2. Number - All Departments
MPI-I-98-1-027
Delaunay graphs by divide and conquer
Burnikel, Christoph
October 1998, 24 pages.
.Status: available - back from printing
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.
-
- Attachement: MPI-I-98-1-027.ps (1767 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-1-027
BibTeX@TECHREPORT{Burnikel98-1-027,
AUTHOR = {Burnikel, Christoph},
TITLE = {Delaunay graphs by divide and conquer},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-98-1-027},
MONTH = {October},
YEAR = {1998},
ISSN = {0946-011X},
}