<div dir="ltr">Forgot to send this email to the mailing list.<br><br><div class="gmail_quote"><div dir="ltr">I have updated the point generator implementation to be more fair. The first pass was quickly done on the airplane, and caused the points to fall on a straight line in space causing some really bad octree behavior. Now I get the vector implementation being roughly 4 times faster.</div>
<div class="gmail_extra"><div><div class="h5"><br><br><div class="gmail_quote">On Mon, Mar 18, 2013 at 2:15 AM, Philippe Pébay <span dir="ltr"><<a href="mailto:philippe.pebay@kitware.com" target="_blank">philippe.pebay@kitware.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Sorry, I did not notice that the .h also contained the implementation.<br><br>Thanks<span><font color="#888888"><br>
P</font></span><div><div><br><br><div class="gmail_quote">On Mon, Mar 18, 2013 at 7:14 AM, Philippe Pébay <span dir="ltr"><<a href="mailto:philippe.pebay@kitware.com" target="_blank">philippe.pebay@kitware.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Thanks Robert, this is most useful. On the github web interfact I can only see the headers, how can I look at the implementation files?<br>
<br>Thanks again<span><font color="#888888"><br>P</font></span><div><div><br><br><div class="gmail_quote">On Mon, Mar 18, 2013 at 7:08 AM, Robert Maynard <span dir="ltr"><<a href="mailto:robert.maynard@kitware.com" target="_blank">robert.maynard@kitware.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div dir="ltr">For DAX we have had good success with sort, unique and than lower bounds to reduce a vector of points into the unique points.<div>
<br></div><div><div>To can check out the benchmark code I wrote here: <a href="https://github.com/robertmaynard/PointMergingBenchmark" target="_blank">https://github.com/robertmaynard/PointMergingBenchmark</a> to try out</div>
<div>both an incremental octree point locator and the sort code. </div></div><div><br></div><div>On 10 million points with 66% of them being duplicates under release mode ( which is very important ), I get the lower bounds methods</div>
<div>being ~9 to 10 times faster. </div><div><br></div><div><br></div></div><div class="gmail_extra"><br><br><div class="gmail_quote"><div><div>On Sun, Mar 17, 2013 at 8:25 AM, Philippe Pébay <span dir="ltr"><<a href="mailto:philippe.pebay@kitware.com" target="_blank">philippe.pebay@kitware.com</a>></span> wrote:<br>
</div></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div><div>Hello all,<br><br>I have a question regarding the most efficient way to insert points in an iterative method creating those as the algorithm progresses.<br>
<br>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.<br>
<br>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. <br><br>If anyone has looked into this issue I would appreciate any elements of discussion.<br>
<br>Thank you<span><font color="#888888"><br>Philippe<br clear="all"><br>-- <br><font color="#888888">Philippe Pébay, PhD<br></font><font color="#888888">Director of Visualization and High Performance Computing /<br>
</font><font color="#888888">Directeur de la Visualisation et du Calcul Haute Performance<br>
Kitware SAS<br>26 rue Louis Guérin, 69100 Villeurbanne, France</font><br>
<font color="#888888"><a value="+33426685003">+33 (0) 6.83.61.55.70 / 4.37.45.04.15</a></font><font color="#888888"><br><a href="http://www.kitware.fr/" target="_blank">http://www.kitware.fr</a></font><font color="#888888"><a href="http://www.kitware.fr/" target="_blank"></a></font>
</font></span><br></div></div>_______________________________________________<br>
Powered by <a href="http://www.kitware.com" target="_blank">www.kitware.com</a><br>
<br>
Visit other Kitware open-source projects at <a href="http://www.kitware.com/opensource/opensource.html" target="_blank">http://www.kitware.com/opensource/opensource.html</a><br>
<br>
Follow this link to subscribe/unsubscribe:<br>
<a href="http://www.vtk.org/mailman/listinfo/vtk-developers" target="_blank">http://www.vtk.org/mailman/listinfo/vtk-developers</a><br>
<br>
<br></blockquote></div><span><font color="#888888"><br><br clear="all"><div><br></div>-- <br>Robert Maynard
</font></span></div>
</blockquote></div><br><br clear="all"><br>-- <br><font color="#888888">Philippe Pébay, PhD<br></font><font color="#888888">Director of Visualization and High Performance Computing /<br>
</font><font color="#888888">Directeur de la Visualisation et du Calcul Haute Performance<br>
Kitware SAS<br>26 rue Louis Guérin, 69100 Villeurbanne, France</font><br>
<font color="#888888"><a value="+33426685003">+33 (0) 6.83.61.55.70 / 4.37.45.04.15</a></font><font color="#888888"><br><a href="http://www.kitware.fr/" target="_blank">http://www.kitware.fr</a></font><font color="#888888"><a href="http://www.kitware.fr/" target="_blank"></a></font>
</div></div></blockquote></div><br><br clear="all"><br>-- <br><font color="#888888">Philippe Pébay, PhD<br></font><font color="#888888">Director of Visualization and High Performance Computing /<br>
</font><font color="#888888">Directeur de la Visualisation et du Calcul Haute Performance<br>
Kitware SAS<br>26 rue Louis Guérin, 69100 Villeurbanne, France</font><br>
<font color="#888888"><a value="+33426685003">+33 (0) 6.83.61.55.70 / 4.37.45.04.15</a></font><font color="#888888"><br><a href="http://www.kitware.fr/" target="_blank">http://www.kitware.fr</a></font><font color="#888888"><a href="http://www.kitware.fr/" target="_blank"></a></font>
</div></div></blockquote></div><br><br clear="all"><div><br></div></div></div><span class="HOEnZb"><font color="#888888">-- <br>Robert Maynard
</font></span></div>
</div><br><br clear="all"><div><br></div>-- <br>Robert Maynard
</div>