Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Access to edge

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Access to edge


Chronological Thread 
  • From: Manuel Caroli <>
  • To:
  • Subject: Re: [cgal-discuss] Access to edge
  • Date: Tue, 28 Jul 2009 16:26:53 +0200

Hi 400555,

I can only repeat what Olivier was saying. Maybe the following function (which is documented at the same place) might be more helpful to you:

bool t.is_edge ( Vertex_handle va, Vertex_handle vb, Face_handle& fr, int & i)
as above. In addition, if true is returned, the edge with vertices va and vb is the edge e=(fr,i) where fr is a handle to the face incident to e and on the right side of e oriented from va to vb.

The worst case complexity is O(deg(va))

best

Manuel


400555 wrote:
Thank you.
How about first part of my questions: how to get edge from 2 vertices?

And do you know time complexity of function t.is_edge ?

On Tue, Jul 28, 2009 at 3:42 PM, Olivier Devillers < <mailto:>> wrote:

400555 a écrit :

Hello.
Let us suppose that we have Delaunay 2D triangulation.
How to get edge from it if I know 2 vertices ?
And how to check if there is an edge in triangulation between
these two vertices?

Thank you.


looking at the manual is often useful !


http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html#Cross_link_anchor_1166

bool t.is_edge ( Vertex_handle va, Vertex_handle vb)
true if there is an edge having va and vb as vertices.
-- You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss






Archive powered by MHonArc 2.6.16.

Top of Page