Skip to Content.
Sympa Menu

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

Subject: CGAL users discussion list

List archive

[cgal-discuss] Access to edge


Chronological Thread 
  • From: 400555 <>
  • To:
  • Subject: [cgal-discuss] Access to edge
  • Date: Tue, 28 Jul 2009 15:38:24 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:sender:date:x-google-sender-auth:message-id:subject :from:to:content-type; b=gGL433z630zrEYbRI+rAURuErV+fVvi/O12w5MscEGVeJYUeKD0oqjivRAv6BH+dCF KLFcd+XyUJwjlSV+PJOlPEJVA/70VN2qeMEmpqvPPhdeLSdWfkLuPBss0byrU3QQ1OLt 63srk44njVdiubZMDWw2SXLp28It0dRFPGFa4=

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.



Archive powered by MHonArc 2.6.16.

Top of Page