[vtk-developers] A question regarding the most efficient way to merge neighbouring points in an iterative method

[Philippe Pébay]

Hello all,

I have a question regarding the most efficient way to insert points in an
iterative method creating those as the algorithm progresses.

Naively I am using a locator to insert each new point and possibly merge it
on the fly if it is epsilon-close to a pre-existing one. This is
convenient  and memory-wise this is efficient because the code does not
grow a list of replicated points.

However, if we put memory aside and focus on speed, then it seems to be
more effective to merge points in a single pass, once they have all been
created. Especially as the complexity of the mesh increases.

If anyone has looked into this issue I would appreciate any elements of
discussion.

Thank you
Philippe

-- 
Philippe Pébay, PhD
Director of Visualization and High Performance Computing /
Directeur de la Visualisation et du Calcul Haute Performance
Kitware SAS
26 rue Louis Guérin, 69100 Villeurbanne, France
+33 (0) 6.83.61.55.70 / 4.37.45.04.15
http://www.kitware.fr <http://www.kitware.fr/>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://public.kitware.com/pipermail/vtk-developers/attachments/20130317/5f5ac49f/attachment.html>