Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] which operation is more efficient when proccsing with large size Delaunay_triangulation_3

Subject: CGAL users discussion list

List archive

[cgal-discuss] which operation is more efficient when proccsing with large size Delaunay_triangulation_3


Chronological Thread 
  • From: Shuchu Han <>
  • To:
  • Subject: [cgal-discuss] which operation is more efficient when proccsing with large size Delaunay_triangulation_3
  • Date: Fri, 11 Dec 2009 13:41:53 +0800
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=ReEU0AwO6V157jXotIdsiLPK6VUnhfX+BT21FySeWIBxwkLU3/29x7ky5nujoCf7xr 0hPu+4wPydbtRJg6rULQX7v1mwXcOsKnPrlKBSYagwcQDtV6dF+4YG7wFfhBhR7fsbF4 uPDs4xt7+Y4oAEWpfvzBxo5pfwXbB9WDo+wl4=

Hi, all

Currently, I'm doing some isotropic remeshing jobs. I try to remesh  a Delaunay triangluation_3 which has 1~5 million vertices.
At the end of each optimization step, the location of the vertices will be update to another place.  and as i know, there are two method to finish this update:

1)  using one triangulation object and use the   "Triangluation_3::move_point()"  operation;
2) using two copy triangulation objects.  and  use the "t.swap ( Triangulation_3 & tr)" operation to update the whole triangulation. 

Is there any one know the efficient between these two operations, which one is more fast?


Best regards
shuchu   



Archive powered by MHonArc 2.6.16.

Top of Page