|
| 1 | +package com.mapbox.turf; |
| 2 | + |
| 3 | +import androidx.annotation.NonNull; |
| 4 | +import com.mapbox.geojson.Point; |
| 5 | + |
| 6 | +import java.util.ArrayList; |
| 7 | +import java.util.List; |
| 8 | + |
| 9 | +/** |
| 10 | + * Use this class to simplify a complex line via Douglas-Peucker and radial algorithms. |
| 11 | + */ |
| 12 | +public class TurfSimplify { |
| 13 | + |
| 14 | + /** |
| 15 | + * Simplifies provided list of coordinates points into a shorter list of coordinates. |
| 16 | + * |
| 17 | + * @param original the coordinates to simplify |
| 18 | + * @param tolerance tolerance in the same measurement as the point coordinates |
| 19 | + * @param highQuality true for using Douglas-Peucker, false for Radial-Distance algorithm |
| 20 | + * @return simplified coordinates |
| 21 | + */ |
| 22 | + public static List<Point> simplify( |
| 23 | + @NonNull List<Point> original, |
| 24 | + double tolerance, |
| 25 | + boolean highQuality |
| 26 | + ) { |
| 27 | + if (original.size() <= 2) { |
| 28 | + return original; |
| 29 | + } |
| 30 | + double squaredTolerance = tolerance * tolerance; |
| 31 | + List<Point> dpInput = highQuality ? original : simplifyRadial(original, squaredTolerance); |
| 32 | + return simplifyDouglasPeucker(dpInput, squaredTolerance); |
| 33 | + } |
| 34 | + |
| 35 | + private static List<Point> simplifyRadial( |
| 36 | + @NonNull List<Point> original, |
| 37 | + double squaredTolerance |
| 38 | + ) { |
| 39 | + if (original.size() <= 2) { |
| 40 | + return original; |
| 41 | + } |
| 42 | + Point prevCoordinate = original.get(0); |
| 43 | + List<Point> newCoordinates = new ArrayList<>(); |
| 44 | + newCoordinates.add(prevCoordinate); |
| 45 | + Point coordinate = original.get(1); |
| 46 | + |
| 47 | + for (int i = 1; i < original.size(); i++) { |
| 48 | + coordinate = original.get(i); |
| 49 | + if (squaredDistance(coordinate, prevCoordinate) > squaredTolerance) { |
| 50 | + newCoordinates.add(coordinate); |
| 51 | + prevCoordinate = coordinate; |
| 52 | + } |
| 53 | + } |
| 54 | + |
| 55 | + if (prevCoordinate != coordinate) { |
| 56 | + newCoordinates.add(coordinate); |
| 57 | + } |
| 58 | + |
| 59 | + return newCoordinates; |
| 60 | + } |
| 61 | + |
| 62 | + private static double squaredDistance(@NonNull Point p1, @NonNull Point p2) { |
| 63 | + double dx = p2.longitude() - p1.longitude(); |
| 64 | + double dy = p2.latitude() - p1.latitude(); |
| 65 | + return dx * dx + dy * dy; |
| 66 | + } |
| 67 | + |
| 68 | + private static List<Point> simplifyDouglasPeucker( |
| 69 | + @NonNull List<Point> original, |
| 70 | + double tolerance |
| 71 | + ) { |
| 72 | + if (original.size() <= 2) { |
| 73 | + return original; |
| 74 | + } |
| 75 | + |
| 76 | + int lastPointIndex = original.size() - 1; |
| 77 | + List<Point> result = new ArrayList<>(); |
| 78 | + result.add(original.get(0)); |
| 79 | + simplifyDouglasPeuckerStep(original, 0, lastPointIndex, tolerance, result); |
| 80 | + result.add(original.get(lastPointIndex)); |
| 81 | + return result; |
| 82 | + } |
| 83 | + |
| 84 | + private static void simplifyDouglasPeuckerStep( |
| 85 | + @NonNull List<Point> original, |
| 86 | + int startIndex, |
| 87 | + int endIndex, |
| 88 | + double tolerance, |
| 89 | + @NonNull List<Point> simplified |
| 90 | + ) { |
| 91 | + double maxSquaredDistance = tolerance; |
| 92 | + int index = 0; |
| 93 | + |
| 94 | + for (int i = startIndex + 1; i < endIndex; i++) { |
| 95 | + double squaredDistance = squaredSegmentDistance( |
| 96 | + original.get(i), |
| 97 | + original.get(startIndex), |
| 98 | + original.get(endIndex) |
| 99 | + ); |
| 100 | + if (squaredDistance > maxSquaredDistance) { |
| 101 | + index = i; |
| 102 | + maxSquaredDistance = squaredDistance; |
| 103 | + } |
| 104 | + } |
| 105 | + |
| 106 | + if (maxSquaredDistance > tolerance) { |
| 107 | + if (index - startIndex > 1) { |
| 108 | + simplifyDouglasPeuckerStep(original, startIndex, index, tolerance, simplified); |
| 109 | + } |
| 110 | + simplified.add(original.get(index)); |
| 111 | + if (endIndex - index > 1) { |
| 112 | + simplifyDouglasPeuckerStep(original, index, endIndex, tolerance, simplified); |
| 113 | + } |
| 114 | + } |
| 115 | + } |
| 116 | + |
| 117 | + private static double squaredSegmentDistance( |
| 118 | + @NonNull Point point, |
| 119 | + @NonNull Point segmentStart, |
| 120 | + @NonNull Point segmentEnd |
| 121 | + ) { |
| 122 | + double x = segmentStart.latitude(); |
| 123 | + double y = segmentStart.longitude(); |
| 124 | + double dx = segmentEnd.latitude() - x; |
| 125 | + double dy = segmentEnd.longitude() - y; |
| 126 | + |
| 127 | + if (dx != 0 || dy != 0) { |
| 128 | + double t = ((point.latitude() - x) * dx + (point.longitude() - y) * dy) / (dx * dx + dy * dy); |
| 129 | + if (t > 1) { |
| 130 | + x = segmentEnd.latitude(); |
| 131 | + y = segmentEnd.longitude(); |
| 132 | + } else if (t > 0) { |
| 133 | + x += dx * t; |
| 134 | + y += dy * t; |
| 135 | + } |
| 136 | + } |
| 137 | + |
| 138 | + dx = point.latitude() - x; |
| 139 | + dy = point.longitude() - y; |
| 140 | + |
| 141 | + return dx * dx + dy * dy; |
| 142 | + } |
| 143 | +} |
0 commit comments