Esempio n. 1
0
void addNearest(Delaunay &T)
{
      Delaunay::Finite_vertices_iterator vit;

    for (vit = T.finite_vertices_begin(); vit != T.finite_vertices_end();++vit)
    {
    
        Delaunay::Vertex_circulator vit2, done;
        std::vector <Vertex_handle> L;
        vit2 = vit->incident_vertices();
        done = vit2;
        do {
            if (T.is_infinite(vit2)) continue;
            std::stringstream ss1, ss2;
            int a, b;

            ss1 << vit->info();
            ss2 << vit2->info();


            ss1 >> a; ss2 >> b;

            if (b == a) continue;

           G[a].push_back(b);

        } while (++vit2 != done);


    }

}