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. We show particular examples using those algorithms to compute distance between points or polygons. Finally we compare them w.r.t. performance and accuracy. Our ultimate goal is a distance function that given a user defined accuracy utilize the most efficient algorithm.

We sum up by briefing next steps of development in Boost.Geometry and ideas for GSoC'18.


Photo of Vissarion Fysikopoulos Vissarion Fysikopoulos