cgal-discuss - [cgal-discuss] accessing vertex handle of vertices in a triangulation through the triangle structure

Subject: CGAL users discussion list

List archive

[cgal-discuss] accessing vertex handle of vertices in a triangulation through the triangle structure

From: Query Cgal <>
To:
Subject: [cgal-discuss] accessing vertex handle of vertices in a triangulation through the triangle structure
Date: Tue, 24 Feb 2009 19:53:25 -0800 (PST)
Domainkey-signature: a=rsa-sha1; q=dns; c=nofws; s=s1024; d=yahoo.com.hk; h=Message-ID:X-YMail-OSG:Received:X-Mailer:Date:From:Reply-To:Subject:To:MIME-Version:Content-Type; b=Pi/Ln87QavApu43zSVdN9Npf/Y1QxHAWJsNhniimztHsPSBAmWsVukIHplXKc/TlsGtZ9K9I7+DY2mvq9QFj0rgbNcg3hA3bG+YQhi9jDNQE5T5F1hqD2dKjI8ZPQxwZNPTSb2fHllPxDN5Mcs/Ho9Z8y11/YbMN80QMaGFuXPg=;

Hello.

I have a 3D triangulation named Dt. And I have tried the following

Triangle t = Dt.triangle(*curr); //where curr is a facet_iterator

t.vertex(0);                             //when I try this in the code, this line return a Point instead
                                            // of a vertex handle

Vertex_handle v1 = Dt.nearest_vertex(t.vertex(0));    // I can get the vertex handle in this
                                                                           //way.

If I used the last line of the code o get the vertex handle of the triangle, the program runs very slowly.

May I know if there is any other ways to get the vertex handle instead of using the nearest_vertex() function?

Thank you

Yahoo!香港提供網上安全攻略，教你如何防範黑客!了解更多

[cgal-discuss] accessing vertex handle of vertices in a triangulation through the triangle structure, Query Cgal, 02/25/2009
- Re: [cgal-discuss] accessing vertex handle of vertices in a triangulation, Mariette Yvinec, 02/25/2009

List archive

[cgal-discuss] accessing vertex handle of vertices in a triangulation through the triangle structure