Subject: CGAL users discussion list
List archive
- From: Andreas Fabri <>
- To:
- Subject: Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay
- Date: Tue, 19 Jun 2007 15:32:17 +0200
thetis guan wrote:
sorry, i can not express my meaning!
i want access to all incident faces of a arbitary vertex, then get incident vertices through these faces.
DT dt;
Vertex_handle vh = .. ;
DT::Face_circulator fc = dt.incident_faces(vh), done(fc);
// Now we walk counterclockwise around vh
do {
Face_handle fh = fc; // not really needed. You can replace fh by fc in what
follows
int i = fh->index(v); // is is such that fh->vertex(i) == vh holds
Vertex_handle other = fh->vertex(DT::cw(i)); // The clockwise neighbor of v
in the face
}while(fc != done);
- how to get all nearest vertices of a vertex of delaunay, thetis guan, 06/18/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, Tyver Ray, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, Andreas Fabri, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, Bernd Gaertner, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, thetis guan, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, thetis guan, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, Andreas Fabri, 06/19/2007
- Re: [cgal-discuss] how to get all nearest vertices of a vertex of delaunay, Bernd Gaertner, 06/19/2007
Archive powered by MHonArc 2.6.16.