Mainly the implementation for Douglas-Peucker algorithm.
Asked
Active
Viewed 2,251 times
2 Answers
4
You can use https://github.com/hgoebl/simplify-java
Simplification of a 2D-polyline or a 3D-polyline.
- Uses Radial-Distance algorithm (fast) or Douglas-Peucker (high quality) algorithm
- Port of mourner / simplify-js, a High-performance JavaScript 2D/3D polyline simplification library by Vladimir Agafonkin
- Can handle arbitrary objects carrying coordinates (2D, 3D) either by implementing an interface or by providing a helper extracting the coordinates
- Leaves the objects untouched, just creates a new array referencing the simplified points
- requires Java 5
- Maven Build
- JUnit-tested, 94% lines covered, reference data is created by "original" JavaScript implementation (Version 1.1.0)

hgoebl
- 12,637
- 9
- 49
- 72
-
I have an issue with trying to implement your library code. Can you shed some light? http://stackoverflow.com/questions/34010298/simplify-java-by – Aggressor Dec 01 '15 at 00:01
-
I'll help you, one moment please... – hgoebl Dec 01 '15 at 06:41
2
You could try JTS (LGPL licence) and it's DouglasPeuckerLineSimplifier
.
(Note it was last updated 2006)

SuperBiasedMan
- 9,814
- 10
- 45
- 73

jeha
- 10,562
- 5
- 50
- 69
-
-
I get the *"404 - File or directory not found."* error on both links. – Janez Kuhar May 05 '18 at 10:50