public static Set<Double> edgeAngles(final Node<?> node) {
final Set<Double> angles = new TreeSet<>(new NumericComparator<Double>());
for (final Edge<?> edge : node.getInEdges()) {
final double toAngle = edge.getToAngle();
angles.add(toAngle);
}
for (final Edge<?> edge : node.getOutEdges()) {
final double fromAngle = edge.getFromAngle();
angles.add(fromAngle);
}
return angles;
}
public static Map<String, Set<Double>> edgeAnglesByType(final Node<?> node) {
final Map<String, Set<Double>> anglesByType = new HashMap<>();
for (final Edge<?> edge : node.getInEdges()) {
final String typePath = edge.getTypeName();
final double toAngle = edge.getToAngle();
final Set<Double> angles = getAnglesForType(anglesByType, typePath);
angles.add(toAngle);
}
for (final Edge<?> edge : node.getOutEdges()) {
final String typePath = edge.getTypeName();
final double fromAngle = edge.getFromAngle();
final Set<Double> angles = getAnglesForType(anglesByType, typePath);
angles.add(fromAngle);
}
return anglesByType;
}
public static List<LineString> intersection(
final GeometryFactory geometryFactory,
final LineString points1,
final LineString points2,
final double maxDistance) {
final LineStringGraph graph1 = new LineStringGraph(points1);
graph1.setPrecisionModel(geometryFactory);
final LineStringGraph graph2 = new LineStringGraph(points2);
graph2.setPrecisionModel(geometryFactory);
final Map<Point, Point> movedNodes = new HashMap<>();
graph1.forEachNode((node) -> movePointsWithinTolerance(movedNodes, graph2, maxDistance, node));
graph2.forEachNode((node) -> movePointsWithinTolerance(movedNodes, graph1, maxDistance, node));
final Map<Edge<LineSegment>, List<Node<LineSegment>>> pointsOnEdge1 =
graph1.getPointsOnEdges(graph2, maxDistance);
final Map<Edge<LineSegment>, List<Node<LineSegment>>> pointsOnEdge2 =
graph2.getPointsOnEdges(graph1, maxDistance);
graph1.splitEdges(pointsOnEdge1);
graph2.splitEdges(pointsOnEdge2);
Point startPoint = points1.getPoint(0);
if (movedNodes.containsKey(startPoint)) {
startPoint = movedNodes.get(startPoint);
}
Point endPoint = points1.getPoint(points1.getVertexCount() - 1);
if (movedNodes.containsKey(endPoint)) {
endPoint = movedNodes.get(endPoint);
}
final List<LineString> intersections = new ArrayList<>();
final List<Point> currentCoordinates = new ArrayList<>();
Node<LineSegment> previousNode = graph1.getNode(startPoint);
do {
final List<Edge<LineSegment>> outEdges = previousNode.getOutEdges();
if (outEdges.isEmpty()) {
previousNode = null;
} else if (outEdges.size() > 1) {
throw new IllegalArgumentException("Cannot handle overlaps\n" + points1 + "\n " + points2);
} else {
final Edge<LineSegment> edge = outEdges.get(0);
final LineSegment line = edge.getObject();
final Node<LineSegment> nextNode = edge.getToNode();
if (graph2.hasEdgeBetween(previousNode, nextNode)) {
if (currentCoordinates.size() == 0) {
currentCoordinates.add(line.getPoint(0));
}
currentCoordinates.add(line.getPoint(1));
} else {
if (currentCoordinates.size() > 0) {
final LineString points =
new LineStringDouble(points1.getAxisCount(), currentCoordinates);
intersections.add(points);
currentCoordinates.clear();
}
}
previousNode = nextNode;
}
} while (previousNode != null && !endPoint.equals(2, startPoint));
if (currentCoordinates.size() > 0) {
final LineString points = new LineStringDouble(points1.getAxisCount(), currentCoordinates);
intersections.add(points);
}
return intersections;
}