https://svn.boost.org/trac10/ticket/12933 <p> ISSUE:<br /> </p> <p> in &lt;boost/geometry/strategies/cartesian/distance_pythagoras.hpp&gt; currently the distance between points in cartesian space is calculated via the pythagorean theorem (i.e. sqrt(sum of squared coordinate differences);<br /> </p> <p> While that is theoretically correct, the numerics are "horrible" and a much better alternative with very low implementation effort is available via the "Moler and Morrison" algorithm; its convergence rate is cubic and it completely avoids the intermediate blowup of values. The article can be found online here: <a class="ext-link" href="http://blogs.mathworks.com/images/cleve/moler_morrison.pdf"><span class="icon">​</span>http://blogs.mathworks.com/images/cleve/moler_morrison.pdf</a> </p> <p> TODO: check the benefits of the Moler Morrison algorithm and decide about either replacing the current implementation of point distances in cartesian space or, make the Moler Morrison algorithm available as an alternative. </p> en-us /htdocs/site/boost.png https://svn.boost.org/trac10/ticket/12933 Trac 1.4.3 Barend Gehrels Sun, 26 Mar 2017 09:46:29 GMT https://svn.boost.org/trac10/ticket/12933#comment:1 https://svn.boost.org/trac10/ticket/12933#comment:1 <ul> <li><strong>severity</strong> <span class="trac-field-old">Problem</span> → <span class="trac-field-new">Optimization</span> </li> </ul> <p> Thanks for your suggestion </p> Ticket