Brussels / 3 & 4 February 2018


Distance computation in Boost.Geometry

What is the shortest distance between two administrative units in a city? How similar are two hurricane trajectories? In the heart of both questions there is distance computation. In this talk we will discuss distance computation in Boost.Geometry, the library that is currently being used to provide GIS support to MySQL.

We study and implement several families of algorithms for distance (such as iterative, series approximation, elliptic arc length, flat earth approximation, spherical) and compare them w.r.t. performance and accuracy. One application is a distance function that given a user defined accuracy utilize the most efficient algorithm. Additionally, we examine the effect of those algorithms in distance computation between geometries and in nearest neighbor searching by showing particular examples.

We sum up by briefing GSoC'17 results and ideas for GSoC'18 as well as the next steps of development in Boost.Geometry.


Photo of Vissarion Fysikopoulos Vissarion Fysikopoulos