[Boost-bugs] [Boost C++ Libraries] #12933: Improve Calculation of Cartesian Point Distances

Subject: [Boost-bugs] [Boost C++ Libraries] #12933: Improve Calculation of Cartesian Point Distances
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2017-03-25 14:47:20

#12933: Improve Calculation of Cartesian Point Distances
-------------------------------+---------------------------
 Reporter:  manfredweis@…      |      Owner:  barendgehrels
     Type:  Patches            |     Status:  new
Milestone:  To Be Determined   |  Component:  geometry
  Version:  Boost 1.63.0       |   Severity:  Problem
 Keywords:  numeric precision  |
-------------------------------+---------------------------
 ISSUE:[[BR]]

 in <boost/geometry/strategies/cartesian/distance_pythagoras.hpp>
 currently the distance between points in cartesian space is calculated via
 the pythagorean theorem (i.e. sqrt(sum of squared coordinate
 differences);[[BR]]

 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:
 http://blogs.mathworks.com/images/cleve/moler_morrison.pdf


 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.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/12933>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.