diff --git a/Packages/Interval_arithmetic/changes.txt b/Packages/Interval_arithmetic/changes.txt
index 4a6d15d60e7..04b8b78967f 100644
--- a/Packages/Interval_arithmetic/changes.txt
+++ b/Packages/Interval_arithmetic/changes.txt
@@ -1,5 +1,8 @@
 Changes done to the Interval Arithmetic package.
 
+Version 4.109 on 17 July 2001
+- Test Lazy_exact_nt more throughly using Delaunay_3.
+
 Version 4.108 on 17 July 2001
 - Remove debug messages from Lazy_exact_nt.
 
diff --git a/Packages/Interval_arithmetic/test/Interval_arithmetic/Lazy_exact_nt.C b/Packages/Interval_arithmetic/test/Interval_arithmetic/Lazy_exact_nt.C
index 1c2d397be36..988e038edf3 100644
--- a/Packages/Interval_arithmetic/test/Interval_arithmetic/Lazy_exact_nt.C
+++ b/Packages/Interval_arithmetic/test/Interval_arithmetic/Lazy_exact_nt.C
@@ -2,9 +2,11 @@
 
 #include <CGAL/Cartesian.h>
 #include <iostream>
+#include <CGAL/Random.h>
 #include <CGAL/Lazy_exact_nt.h>
 #include <CGAL/MP_Float.h>
 #include <CGAL/Quotient.h>
+#include <CGAL/Delaunay_triangulation_3.h>
 
 #ifdef CGAL_USE_LEDA
 #  include <CGAL/leda_real.h>
@@ -57,6 +59,23 @@ my_min(const NT& n, const NT& m)
 
 } // namespace CGAL
 
+typedef CGAL::Lazy_exact_nt<CGAL::Quotient<CGAL::MP_Float> >  my_NT;
+typedef CGAL::Delaunay_triangulation_3<CGAL::Cartesian<my_NT> > Delaunay;
+
+int my_rand()
+{
+  return int(CGAL::default_random.get_double()*(1<<31));
+}
+
+void delaunay()
+{
+  Delaunay D;
+  for (int i=0; i<100; i++)
+    D.insert(Delaunay::Point(my_NT(my_rand()),
+                             my_NT(my_rand()),
+			     my_NT(my_rand())));
+}
+
 int main ()
 {
   std::cout.precision(20);
@@ -93,6 +112,7 @@ int main ()
   std::cout << "sizeof(Lazy_exact_nt) = " << sizeof(CGAL::Lazy_exact_nt<int>)
             << std::endl;
   predicates();
+  delaunay();
   return 0;
 }