- 
                Notifications
    You must be signed in to change notification settings 
- Fork 25.6k
Description
Description
Asset tracking use cases such as GPS beacons on vehicles can create a lot of geo_points. When constructing a geo_line from a high cardinality set of points, it may be helpful to reduce the result set to only the points necessary to represent the line geometry. Two line simplication algorithms to accomplish this are Ramer–Douglas–Peucker and Visvalingam-Whyatt. Demonstration of both algorithms.
The PR for the Geo Line aggregation suggested having a simplify option to accomplish this, but it was not implemented.
For an example. Let's say we are tracking a single delivery vehicle over a 2000 mile trip. The vehicle is averaging at 45 miles per hour and submits a GPS location every 10 seconds. Over the course of the entire trip the vehicle will send about 16000 locations as geo_points. Currently we can create a geo_line aggregation up to the latest 10000 geo_points. But, since the vehicle spends many minutes traveling in a straight line, we should be able to greatly reduce the number of vertices in the geo_line across the entire 16000 point data set using one of the aforementioned simplification algorithms.