CGAL users discussion list

[Michael Balzer <>]

Hi disruptive,

the Delaunay_triangulation_2 in CGAL is inherited from
Triangulation_2. In this class you find all necessary methods for the
traversal of the triangulation, such as the method t.incident_faces
(Vertex_handle v) for acessing the incident faces of a vertex.


Michael


On Wed, Apr 1, 2009 at 19:47, disruptive 
<>
 wrote:
>
>
>
> disruptive wrote:
>>
>> I wish to iterate over a Delauney triangulation by vertex and for each
>> vertex.
>>
>> I wish to determine the faces that share this vertex. And then for each
>> face, I wish to determine the vertices's that comprise this face (one of
>> which will be the shared the vertex). The latter part can be done.
>>
>> However my question relates to how best to get nearest neighbour vertices,
>> is there a way with the edge function?
>>
>> Some suggestions for the least complex way to do this would be very much
>> appreciated.
>>
>> Thanks
>>
>
>
> Is there a way that I can given a vertex, get the surrounding faces?
>
> --
> View this message in context: 
> http://www.nabble.com/Nearest-neighbour-vertices-tp22786442p22831902.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>