Subject: CGAL users discussion list
List archive
- From: Panagiotis Foteinos <>
- To:
- Subject: [cgal-discuss] 4D Triangulation: nearest neighbour and removal
- Date: Fri, 27 Aug 2010 14:50:58 +0200
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; b=UixROernlkqexlWoI6KpFylbM+ueFrSqRytjyHTNaIV96XL/3EyFfspv8wvTzS5FEa PPbgll6+C6L4rUG0GHWpfhSF/Z/SeCWOxUQA0z9Ie+7GGza3xFj2YeIOBR5XXDmtvlup Es9VBLhFWczfUIUS8BFPDLsLvnIF2hnPa+X84=
Hello developers/users.
I have built a 4D refinement mesher on top of Delaunay_d class. The output mesh I get consists of 64 vertices and 948 pentatopes.
Although the output mesh is small, I observe high execution times. Profiling revealed that the most time (45% of the total execution time) is spent for the method DT.nearest_neighbor(); I call this method at most once per inserted vertex... Is this behavior expected? Could I do sth to speed things up?
Also, I would like to ask if the dynamic vertex removal will be supported in the future. If yes, when should we be expecting it?
Best Regards,
Panagiotis Foteinos
- [cgal-discuss] 4D Triangulation: nearest neighbour and removal, Panagiotis Foteinos, 08/27/2010
Archive powered by MHonArc 2.6.16.