Largest-Triangle downsampling algorithm implementations for Java8
These implementations are based on the paper "Downsampling Time Series for Visual Representation" by Sveinn Steinarsson from the Faculty of Industrial Engineering, Mechanical Engineering and Computer Science University of Iceland (2013). You can read the paper here
The goal of Largest-Triangle downsampling algorithms for data visualization is to reduce the number of points in a number series without losing important visual features of the resulting graph. It is important to be aware that these algorithms are not numerically correct.
Download
Latest version: 0.0.6
You can add this library into your Maven/Gradle/SBT/Leiningen project thanks to JitPack.io. Follow the instructions here.
Example Gradle instructions
Add this into your build.gradle file:
allprojects {
repositories {
maven { url 'https://jitpack.io' }
}
}
dependencies {
compile 'com.github.ggalmazor:lt_downsampling_java8:0.0.6'
}Largest-Triangle Three-Buckets
This version of the algorithm groups numbers in same sized buckets and then selects from each bucket the point that produces the largest area with points on neighbour buckets.
You can produce a downsampled version of an input series with:
List<Point> input = Arrays.asList(...);
int numberOfBuckets = 200;
List<Point> output = LTThreeBuckets.ofSorted(input, numberOfBuckets);First and last points of the original series are always in the output. Then, the rest are grouped into the defined amount of buckets and the algorithm chooses the best point from each bucket, resulting in a list of 202 elements.
You can translate your domain objects into Point instances and back or extend have your Domain extend Point to make things easier.
Largest-Triangle Dynamic
Not yet implemented