CGAL users discussion list

["Wesley Smith" <>]

What a difference a day makes.  I managed to make this design alot
simpler.  Here's an implementation that iterates in a CCW fashion
around a vertex in a 3D Delaunay diagram using the next_around_edge
util function:

This is from the Halfedge class of Voronoi_diagram_3

Halfedge_handle next(Delaunay_vertex_handle v) const {
                int index;
                CGAL_precondition( c_->has_vertex(v, index) );
                return next( index );
        }

Halfedge_handle next(int vi) const {
                CGAL_precondition(i_ != vi);
                Delaunay_facet f(c_, DG::next_around_edge(i_, vi));
                
                if(! vda_->dual().is_infinite( c_->neighbor(f.second) ) ) {
                        //SEGMENT (transform into new cell)
                        Cell_handle c = c_->neighbor(f.second);
                        return Halfedge_handle( Halfedge_3(vda_, c, 
c->index(f.first)) );
                }
                else {
                        //RAY (stays in cell)
                        return Halfedge_handle( Halfedge_3(vda_, f) );
                }
        }



wes