We define and implement the data type
delaunay. It maintains
Delaunay triangulations in arbitrary dimensions and supports
insertions of points, lookup and location queries. The delaunay
triangulations are derived from the convex hull data type
chull and
maintains the closest and furthest site Delaunay triangulation.
The first author implemented the first version of this data type. The
second author generalized it to templatization via traits classes.
Section ddtraitsimpl is a beautiful exapmle for the traits class
technique as introduced in []
