CGAL users discussion list

yes, this solves the problem. However, implementing an incident_edges 
method inspired from incident_vertices would be more efficient.

Jingyi Jin wrote:
> Dear Monique,
>
> Thank you for answering my question! Yes, I'd seen your previous
> answer. I thought originally that even incident vertices are given, I
> still have to compute pairwise set intersection of their incident
> cells, and loop over the cell indices to find out one representation
> of the incident edge. I looked the reference manual more carefully,
> and found this method that retrieves an edge (if it exists), given two
> vertex handles.
>
> bool  tds.is_edge (  Vertex_handle u,
> Vertex_handle v,
> Cell_handle & c,
> int & i,
> int & j)
>
> This is what I need, and my current problem is solved. Thank you very
> much for the help!
>
> best,
>
> Jingyi
>
> On 5/22/07, 
>
> <>
>  wrote:
>
> > Hi Jingyi,
> >
> > What about my previous answer (see attachment)?
> > Edges are not explicitely stored in a 3d triangulation.
> > We provide a way to get all incident vertices.
> > We could provide also a function giving a representative of each
> > incident edge, but it is not implemented... I guess it is quite easy to
> > implement, looking at the code of incident_vertices.
> >
> > Best,
> >        Monique Teillaud
> >
> > Jingyi Jin wrote:
> > > Hi,
> > >
> > > Following a previous post to ask one question..
> > >
> > > 
> > ---------------------------------------------------------------------------- 
> >
> > >
> > > On 5/4/07, 
> >
> > > 
> > <>
> >  wrote:
> > >
> > >> In 2D, having an edge circulator is natural and meaningful: edges are
> > >> ordered around a vertex. In 3D edges are not circularly ordered 
> > around a
> > >> vertex.
> > >
> > > 
> > ---------------------------------------------------------------------------- 
> >
> > >
> > >
> > > If I want to retrieve all incident edges of a vertex, what is the best
> > > way to do that? The order does not matter in my application.
> > >
> > > Thanks a lot!
> > >
> > > Jingyi
> > --
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss