diff --git a/Packages/Point_set_2/include/CGAL/Point_set_2.h b/Packages/Point_set_2/include/CGAL/Point_set_2.h
index 9e63b9e89a8..6e53e4bb7a9 100644
--- a/Packages/Point_set_2/include/CGAL/Point_set_2.h
+++ b/Packages/Point_set_2/include/CGAL/Point_set_2.h
@@ -262,7 +262,7 @@ public:
        comp(& priority_number);      // comparison object ...
      std::priority_queue<Vertex_handle, std::vector<Vertex_handle>, CGAL::compare_vertices<Vertex_handle,Numb_type,MAP_TYPE> > PQ(comp);
 
-     priority_number[& (*v)] = 0;
+     priority_number[v] = 0;
      PQ.push(v);
      
      mark_vertex(v);
diff --git a/Packages/Point_set_2/include/CGAL/nearest_neighbor_delaunay_2.h b/Packages/Point_set_2/include/CGAL/nearest_neighbor_delaunay_2.h
index 81d90368647..3104ad6ebee 100644
--- a/Packages/Point_set_2/include/CGAL/nearest_neighbor_delaunay_2.h
+++ b/Packages/Point_set_2/include/CGAL/nearest_neighbor_delaunay_2.h
@@ -234,8 +234,8 @@ void nearest_neighbors_list(const Dt& delau, typename Dt::Vertex_handle v, int k
   compare_vertices<Vertex_handle,Numb_type,MAP_TYPE> comp(& priority_number);      // comparison object ...
   std::priority_queue<Vertex_handle, std::vector<Vertex_handle>, CGAL::compare_vertices<Vertex_handle,Numb_type,MAP_TYPE> > PQ(comp);
 
-  priority_number[& (*v)] = 0;
-  PQ.push(& (*v));
+  priority_number[v] = 0;
+  PQ.push(v);
      
   // mark vertex v
   mark[v] = cur_mark;
@@ -255,7 +255,7 @@ void nearest_neighbors_list(const Dt& delau, typename Dt::Vertex_handle v, int k
     Vertex_handle act;
      
     do {
-         act = vc->handle();
+         act = vc;
 	 
 	 // test, if act is marked ...
 	 bool is_marked = mark.is_defined(act);