We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons have shown that our implementation outperforms the best currently available codes for convex hulls and Delaunay triagulations, and that it can be used for quite big input sets in spaces of dimensions up to 6.