| | 1 | // License: GPL. For details, see LICENSE file. |
| | 2 | package org.openstreetmap.josm.data.validation.tests; |
| | 3 | |
| | 4 | import static org.openstreetmap.josm.tools.I18n.tr; |
| | 5 | |
| | 6 | import java.util.ArrayList; |
| | 7 | import java.util.Collection; |
| | 8 | import java.util.Collections; |
| | 9 | import java.util.Comparator; |
| | 10 | import java.util.LinkedHashMap; |
| | 11 | import java.util.List; |
| | 12 | import java.util.Map; |
| | 13 | import java.util.Map.Entry; |
| | 14 | import java.util.Optional; |
| | 15 | import java.util.TreeSet; |
| | 16 | |
| | 17 | import org.openstreetmap.josm.data.coor.EastNorth; |
| | 18 | import org.openstreetmap.josm.data.osm.Node; |
| | 19 | import org.openstreetmap.josm.data.osm.OsmPrimitive; |
| | 20 | import org.openstreetmap.josm.data.osm.Way; |
| | 21 | import org.openstreetmap.josm.data.osm.WaySegment; |
| | 22 | import org.openstreetmap.josm.data.validation.Severity; |
| | 23 | import org.openstreetmap.josm.data.validation.Test; |
| | 24 | import org.openstreetmap.josm.data.validation.TestError; |
| | 25 | import org.openstreetmap.josm.gui.progress.ProgressMonitor; |
| | 26 | import org.openstreetmap.josm.tools.Geometry; |
| | 27 | import org.openstreetmap.josm.tools.Logging; |
| | 28 | |
| | 29 | /** |
| | 30 | * Find highways that have sharp angles |
| | 31 | * @author Taylor Smock |
| | 32 | * |
| | 33 | */ |
| | 34 | public class SharpAngles extends Test { |
| | 35 | private static final int SHARPANGLESCODE = 3800; |
| | 36 | /** The code for a sharp angle */ |
| | 37 | protected static final int SHARP_ANGLES = SHARPANGLESCODE + 0; |
| | 38 | /** The maximum angle for sharp angles */ |
| | 39 | protected double maxAngle = 45.0; // degrees |
| | 40 | /** The length that at least one way segment must be shorter than */ |
| | 41 | protected double maxLength = 10.0; // meters |
| | 42 | /** The stepping points for severity */ |
| | 43 | protected Map<Double, Severity> severityBreakPoints = new LinkedHashMap<>(); |
| | 44 | /** Specific highway types to ignore */ |
| | 45 | protected Collection<String> ignoreHighways = new TreeSet<>(); |
| | 46 | |
| | 47 | ArrayList<Way> allWays; |
| | 48 | /** |
| | 49 | * Construct a new {@code IntersectionIssues} object |
| | 50 | */ |
| | 51 | public SharpAngles() { |
| | 52 | super(tr("Sharp angles"), tr("Check for sharp angles on roads")); |
| | 53 | setBreakPoints(); |
| | 54 | addIgnoredHighway("rest_area"); |
| | 55 | addIgnoredHighway("platform"); |
| | 56 | addIgnoredHighway("services"); |
| | 57 | addIgnoredHighway("via_ferrata"); // mountainside paths |
| | 58 | } |
| | 59 | |
| | 60 | @Override |
| | 61 | public void startTest(ProgressMonitor monitor) { |
| | 62 | super.startTest(monitor); |
| | 63 | allWays = new ArrayList<>(); |
| | 64 | } |
| | 65 | |
| | 66 | @Override |
| | 67 | public void endTest() { |
| | 68 | Way pWay = null; |
| | 69 | try { |
| | 70 | for (Way way : allWays) { |
| | 71 | pWay = way; |
| | 72 | checkWayForSharpAngles(way); |
| | 73 | } |
| | 74 | } catch (Exception e) { |
| | 75 | if (pWay != null) { |
| | 76 | Logging.debug("Way https://osm.org/way/{0} caused an error ({1})", pWay.getOsmId(), e); |
| | 77 | } |
| | 78 | Logging.warn(e); |
| | 79 | } |
| | 80 | allWays = null; |
| | 81 | super.endTest(); |
| | 82 | } |
| | 83 | |
| | 84 | @Override |
| | 85 | public void visit(Way way) { |
| | 86 | if (!way.isUsable()) return; |
| | 87 | if (way.hasKey("highway") && !way.hasTag("area", "yes") && |
| | 88 | !ignoreHighways.contains(way.get("highway"))) { |
| | 89 | allWays.add(way); |
| | 90 | } |
| | 91 | } |
| | 92 | |
| | 93 | /** |
| | 94 | * Check nodes in a way for sharp angles |
| | 95 | * @param way A way to check for sharp angles |
| | 96 | */ |
| | 97 | public void checkWayForSharpAngles(Way way) { |
| | 98 | Node node1 = null; |
| | 99 | Node node2 = null; |
| | 100 | Node node3 = null; |
| | 101 | int i = -2; |
| | 102 | for (Node node : way.getNodes()) { |
| | 103 | node1 = node2; |
| | 104 | node2 = node3; |
| | 105 | node3 = node; |
| | 106 | checkAngle(node1, node2, node3, i, way, false); |
| | 107 | i++; |
| | 108 | } |
| | 109 | if (way.isClosed() && way.getNodesCount() > 2) { |
| | 110 | node1 = node2; |
| | 111 | node2 = node3; |
| | 112 | // Get the second node, not the first node, since a closed way has first node == second node |
| | 113 | node3 = way.getNode(1); |
| | 114 | checkAngle(node1, node2, node3, i, way, true); |
| | 115 | } |
| | 116 | } |
| | 117 | |
| | 118 | private void checkAngle(Node node1, Node node2, Node node3, int i, Way way, boolean last) { |
| | 119 | if (node1 == null || node2 == null || node3 == null) return; |
| | 120 | EastNorth n1 = node1.getEastNorth(); |
| | 121 | EastNorth n2 = node2.getEastNorth(); |
| | 122 | EastNorth n3 = node3.getEastNorth(); |
| | 123 | double angle = Math.toDegrees(Math.abs(Geometry.getCornerAngle(n1, n2, n3))); |
| | 124 | if (angle < maxAngle) { |
| | 125 | processSharpAngleForErrorCreation(angle, i, way, last, node2); |
| | 126 | } |
| | 127 | } |
| | 128 | |
| | 129 | private void processSharpAngleForErrorCreation(double angle, int i, Way way, boolean last, Node pointNode) { |
| | 130 | List<WaySegment> waysegmentList = new ArrayList<>(); |
| | 131 | waysegmentList.add(new WaySegment(way, i)); |
| | 132 | if (last) { |
| | 133 | waysegmentList.add(new WaySegment(way, 0)); |
| | 134 | } else { |
| | 135 | waysegmentList.add(new WaySegment(way, i+1)); |
| | 136 | } |
| | 137 | Optional<WaySegment> possibleShortSegment = waysegmentList.stream() |
| | 138 | .min(Comparator.comparing(segment -> segment.toWay().getLength())); |
| | 139 | if (possibleShortSegment.isPresent() && possibleShortSegment.get().toWay().getLength() < maxLength) { |
| | 140 | createNearlyOverlappingError(angle, Collections.singleton(way), pointNode); |
| | 141 | } |
| | 142 | } |
| | 143 | |
| | 144 | private void createNearlyOverlappingError(double angle, |
| | 145 | Collection<? extends OsmPrimitive> primitiveIssues, OsmPrimitive primitive) { |
| | 146 | TestError.Builder testError = TestError.builder(this, getSeverity(angle), SHARP_ANGLES) |
| | 147 | .primitives(primitiveIssues) |
| | 148 | .highlight(primitive) |
| | 149 | .message(tr("Sharp angle")); |
| | 150 | errors.add(testError.build()); |
| | 151 | } |
| | 152 | |
| | 153 | private Severity getSeverity(double angle) { |
| | 154 | Severity rSeverity = Severity.OTHER; |
| | 155 | for (Entry<Double, Severity> entry : severityBreakPoints.entrySet()) { |
| | 156 | if (angle < entry.getKey()) { |
| | 157 | rSeverity = entry.getValue(); |
| | 158 | } |
| | 159 | } |
| | 160 | return rSeverity; |
| | 161 | } |
| | 162 | |
| | 163 | /** |
| | 164 | * Set the maximum length for the shortest segment |
| | 165 | * @param length The max length in meters |
| | 166 | */ |
| | 167 | public void setMaxLength(double length) { |
| | 168 | maxLength = length; |
| | 169 | } |
| | 170 | |
| | 171 | /** |
| | 172 | * Add a highway to ignore |
| | 173 | * @param highway |
| | 174 | */ |
| | 175 | public void addIgnoredHighway(String highway) { |
| | 176 | ignoreHighways.add(highway); |
| | 177 | } |
| | 178 | |
| | 179 | /** |
| | 180 | * Set the maximum angle |
| | 181 | * @param angle The maximum angle in degrees. |
| | 182 | */ |
| | 183 | public void setMaxAngle(double angle) { |
| | 184 | maxAngle = angle; |
| | 185 | setBreakPoints(); |
| | 186 | } |
| | 187 | |
| | 188 | /** |
| | 189 | * Set the breakpoints for the test |
| | 190 | */ |
| | 191 | private void setBreakPoints() { |
| | 192 | severityBreakPoints.put(maxAngle, Severity.OTHER); |
| | 193 | severityBreakPoints.put(maxAngle * 2 / 3, Severity.WARNING); |
| | 194 | severityBreakPoints.put(maxAngle / 3, Severity.ERROR); |
| | 195 | } |
| | 196 | } |