CGAL users discussion list

hi everyone
 iam learning Chapter 35 spactial searching. i meet a question about example 
of General Neighbor Searching which i can compile but not execute it. 

these codes:

#include "stdafx.h"
#include <CGAL/basic.h>
#include <CGAL/Cartesian_d.h>
#include <CGAL/point_generators_2.h>
#include <CGAL/Manhattan_distance_iso_box_point.h>
#include <CGAL/K_neighbor_search.h>
#include <CGAL/Search_traits_2.h>

typedef CGAL::Cartesian_d<double> K;
typedef K::Point_d Point_d;
typedef CGAL::Random_points_in_square_2<Point_d> Random_points_iterator;
typedef K::Iso_box_d Iso_box_d;
typedef K TreeTraits;
typedef CGAL::Manhattan_distance_iso_box_point<TreeTraits> Distance;
typedef CGAL::K_neighbor_search<TreeTraits, Distance> Neighbor_search;
typedef Neighbor_search::Tree Tree;


int _tmain(int argc, _TCHAR* argv[])
{
        const int N = 1000;
        const int K = 10;
        Tree tree;
        Random_points_iterator rpg;
        for(int i = 0; i < N; i++)
        {
                tree.insert(*rpg++);
        }

        Point_d pp(0.1,0.1);
        Point_d qq(0.2,0.2);
        Iso_box_d query(pp,qq);
        Distance tr_dist;
        Neighbor_search N1(tree, query, K, 0.0, false); 
        std::cout << "For query rectange = [0.1,0.2]ˆ2 " << std::endl
                << "The " << K << " approximate furthest neighbors are: " 
                  << std::endl;
        for (Neighbor_search::iterator it = N1.begin();it != N1.end();it++) 
        {
          std::cout << " Point " << it->first << " at distance = "   <<       
tr_dist.inverse_of_transformed_distance(it->second) << std::endl;
        }

        return 0;
}

when  debug it to the sentence "Iso_box_d query(pp,qq);", a  error message 
will be send that vector iterators incompatible.

How to solve this problem?

best regards

thetis