diff --git a/Packages/Nef_2/changes.txt b/Packages/Nef_2/changes.txt
index aa802b0c63e..4242b75c6c7 100644
--- a/Packages/Nef_2/changes.txt
+++ b/Packages/Nef_2/changes.txt
@@ -1,5 +1,12 @@
 Nef_2 Package: Release changes
 ----------------------------------------------------------------------
+1.27 (17 Apr 2003)
+     - removed a ;; to get rid of a warning
+
+1.26 (4 Apr 2003)
+     - Fixed bug in division
+     - Removed all VC6 workarounds
+     - Added tests of Extended_cartesian_kernel
 
 1.25 (21 Jan 2003)
 
diff --git a/Packages/Nef_2/test/Nef_2/Nef_polyhedron_2-test.C b/Packages/Nef_2/test/Nef_2/Nef_polyhedron_2-test.C
index ec5ad049552..22a165d67b8 100644
--- a/Packages/Nef_2/test/Nef_2/Nef_polyhedron_2-test.C
+++ b/Packages/Nef_2/test/Nef_2/Nef_polyhedron_2-test.C
@@ -26,6 +26,7 @@ int main()
   std::cerr << "using " << CGAL::pointlocationversion << std::endl;
   std::cerr << "using " << CGAL::sweepversion << std::endl;
   CGAL_TEST_START;
+  
 {
   typedef  CGAL::Extended_homogeneous<Integer> EKernel;
   typedef  CGAL::Nef_polyhedron_2<EKernel> Nef_polyhedron;
@@ -56,8 +57,8 @@ int main()
   CGAL_TEST((!(N1*N2)) == (!N1+!N2));
 
   Nef_polyhedron N3 = N1.intersection(N2);
-  /* N3 is the first quadrant including the positive y-axis
-     but excluding the origin and the positive x-axis */
+  // N3 is the first quadrant including the positive y-axis
+   //  but excluding the origin and the positive x-axis 
 
   CGAL_TEST(N3 < N1 && N3 < N2);
   CGAL_TEST(N3 <= N1 && N3 <= N2);
@@ -150,6 +151,8 @@ int main()
 
 
 }
+
+
 {
   typedef  CGAL::Filtered_extended_homogeneous<Integer> EKernel;
   typedef  CGAL::Nef_polyhedron_2<EKernel> Nef_polyhedron;
@@ -180,8 +183,8 @@ int main()
   CGAL_TEST((!(N1*N2)) == (!N1+!N2));
 
   Nef_polyhedron N3 = N1.intersection(N2);
-  /* N3 is the first quadrant including the positive y-axis
-     but excluding the origin and the positive x-axis */
+  // N3 is the first quadrant including the positive y-axis
+   //  but excluding the origin and the positive x-axis 
 
   CGAL_TEST(N3 < N1 && N3 < N2);
   CGAL_TEST(N3 <= N1 && N3 <= N2);
@@ -276,6 +279,7 @@ int main()
   Nef_polyhedron::EK.print_statistics();
 }
 
+
 {
   typedef double Rational;
   typedef  CGAL::Extended_cartesian<Rational> EKernel;
@@ -312,8 +316,8 @@ int main()
   CGAL_TEST((!(N1*N2)) == (!N1+!N2));
 
   Nef_polyhedron N3 = N1.intersection(N2);
-  /* N3 is the first quadrant including the positive y-axis
-     but excluding the origin and the positive x-axis */
+  // N3 is the first quadrant including the positive y-axis
+   //  but excluding the origin and the positive x-axis 
 
   CGAL_TEST(N3 < N1 && N3 < N2);
   CGAL_TEST(N3 <= N1 && N3 <= N2);