title: Interesting method to compress coordinates (lat/lng)
body: <h1>Task</h1>
  
  <p>Store about 400,000,000 coordinates (lat/lng), with an average density well above 1/(50&times;50)&thinsp;m<sup>2</sup> as efficient as possible.</p>
  
  <h1>Idea</h1>
  
  <p>Generate a polyline going through all coordinates and then use the polyline-compression-algorithm from google: <a href="https://developers.google.com/maps/documentation/utilities/polylinealgorithm?csw=1" rel="nofollow">https://developers.google.com/maps/documentation/utilities/polylinealgorithm?csw=1</a></p>
  
  <h1>Problem</h1>
  
  <p>Find a polyline going through all coordinates only containing short segments, because the polyline-compression-algorithm only works well if the segments are short.</p>
  
  <h1>Question</h1>
  
  <p>What do you think of the idea in general? Do you think it's better than other compression-methods and if not, which method would you recommend for this task?</p>