Delaunay graphs by divide and conquer

Burnikel, Christoph

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Delaunay graphs by divide and conquer

MPS-Authors

/persons/resource/persons44210

Burnikel, Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-98-1-027.pdf
(Any fulltext), 559KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Burnikel, C.(1998). Delaunay graphs by divide and conquer (MPI-I-1998-1-027). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-7B60-5

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.