-
Notifications
You must be signed in to change notification settings - Fork 13
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Signed-off-by: Thomas ADAM <[email protected]>
- Loading branch information
Showing
11 changed files
with
406 additions
and
178 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
23 changes: 23 additions & 0 deletions
23
...ine-diagram-core/src/main/java/com/powsybl/sld/layout/pathfinding/AbstractPathFinder.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| /** | ||
| * Copyright (c) 2023, RTE (http://www.rte-france.com) | ||
| * This Source Code Form is subject to the terms of the Mozilla Public | ||
| * License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| * file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
| * SPDX-License-Identifier: MPL-2.0 | ||
| */ | ||
| package com.powsybl.sld.layout.pathfinding; | ||
|
|
||
| import java.util.*; | ||
|
|
||
| /** | ||
| * @author Thomas Adam <tadam at neverhack.com> | ||
| */ | ||
| public abstract class AbstractPathFinder implements PathFinder { | ||
| @Override | ||
| public List<com.powsybl.sld.model.coordinate.Point> toSnakeLine(List<Point> path) { | ||
| // Change class of Point | ||
| final List<com.powsybl.sld.model.coordinate.Point> snakeLine = new ArrayList<>(); | ||
| path.forEach(p -> snakeLine.add(new com.powsybl.sld.model.coordinate.Point(p.x(), p.y()))); | ||
| return snakeLine; | ||
| } | ||
| } |
109 changes: 0 additions & 109 deletions
109
...m/single-line-diagram-core/src/main/java/com/powsybl/sld/layout/pathfinding/Dijkstra.java
This file was deleted.
Oops, something went wrong.
155 changes: 155 additions & 0 deletions
155
...ine-diagram-core/src/main/java/com/powsybl/sld/layout/pathfinding/DijkstraPathFinder.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,155 @@ | ||
| /** | ||
| * Copyright (c) 2023, RTE (http://www.rte-france.com) | ||
| * This Source Code Form is subject to the terms of the Mozilla Public | ||
| * License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| * file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
| * SPDX-License-Identifier: MPL-2.0 | ||
| */ | ||
| package com.powsybl.sld.layout.pathfinding; | ||
|
|
||
| import java.util.*; | ||
|
|
||
| /** | ||
| * @author Thomas Adam <tadam at neverhack.com> | ||
| */ | ||
| public final class DijkstraPathFinder extends AbstractPathFinder { | ||
|
|
||
| private static final int[] DX = {1, 0, -1, 0}; // Horizontal moves | ||
| private static final int[] DY = {0, 1, 0, -1}; // Vertical moves | ||
|
|
||
| public DijkstraPathFinder() { | ||
| // Nothing to do | ||
| } | ||
|
|
||
| @Override | ||
| public List<Point> findShortestPath(Grid grid, int startX, int startY, int endX, int endY, boolean setSnakeLineAsObstacle) { | ||
| Point start = new Point(startX, startY); | ||
| Point end = new Point(endX, endY); | ||
| Map<Point, Integer> distance = new HashMap<>(); | ||
|
|
||
| PriorityQueue<Point> queue = new PriorityQueue<>(Comparator.comparingInt(distance::get)); | ||
|
|
||
| distance.put(start, 0); | ||
| queue.add(start); | ||
|
|
||
| while (!queue.isEmpty()) { | ||
| Point current = queue.poll(); | ||
| if (current.equals(end)) { | ||
| List<Point> path = reconstructPath(grid, end); | ||
| // Make path not available | ||
| grid.setAvailability(path, false); | ||
| // Reset parent link for next call | ||
| grid.setParent(path, null); | ||
|
|
||
| return smoothPath(path); | ||
| } | ||
|
|
||
| for (int i = 0; i < 4; i++) { | ||
| int newX = current.x() + DX[i]; | ||
| int newY = current.y() + DY[i]; | ||
| Point neighbor = new Point(newX, newY); | ||
|
|
||
| if (grid.isValid(neighbor)) { | ||
| int newDist = distance.get(current) + 1; | ||
| // Calculate the angle between the current path and the new path | ||
| int angle = current.angleBetween(neighbor, start); | ||
|
|
||
| if (!distance.containsKey(neighbor) || newDist < distance.get(neighbor)) { | ||
| distance.put(neighbor, newDist + angle); | ||
| grid.setParent(neighbor, current); | ||
| queue.add(neighbor); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| return new ArrayList<>(); // No path found | ||
| } | ||
|
|
||
| private List<Point> reconstructPath(Grid grid, Point end) { | ||
| List<Point> path = new ArrayList<>(); | ||
| Point current = end; | ||
| while (current != null) { | ||
| path.add(current); | ||
| current = grid.parent(current); | ||
| } | ||
| Collections.reverse(path); | ||
| return path; | ||
| } | ||
|
|
||
| public static List<Point> smoothPath(List<Point> path) { | ||
| if (path.size() < 3) { | ||
| return path; | ||
| } | ||
|
|
||
| List<Point> smoothedPath = new ArrayList<>(); | ||
| smoothedPath.add(path.get(0)); | ||
|
|
||
| for (int i = 1; i < path.size() - 1; i++) { | ||
| Point prev = smoothedPath.get(smoothedPath.size() - 1); | ||
| Point current = path.get(i); | ||
| Point next = path.get(i + 1); | ||
|
|
||
| if (isRightAngle(prev, current, next)) { | ||
| smoothedPath.add(current); | ||
| } | ||
| } | ||
|
|
||
| smoothedPath.add(path.get(path.size() - 1)); | ||
|
|
||
| return smoothedPath; | ||
| } | ||
|
|
||
| private static boolean isRightAngle(Point p1, | ||
| Point p2, | ||
| Point p3) { | ||
| // Check if right angles when scalar products are null | ||
| int dx1 = p2.x() - p1.x(); | ||
| int dy1 = p2.y() - p1.y(); | ||
| int dx2 = p3.x() - p2.x(); | ||
| int dy2 = p3.y() - p2.y(); | ||
|
|
||
| return dx1 * dx2 + dy1 * dy2 == 0; | ||
| } | ||
|
|
||
| public static List<Point> simplify(List<Point> path, double tolerance) { | ||
| if (path == null || path.size() < 3) { | ||
| return path; | ||
| } | ||
|
|
||
| List<Point> simplifiedPath = new ArrayList<>(); | ||
| simplifiedPath.add(path.get(0)); | ||
| simplifyRecursive(path, 0, path.size() - 1, tolerance, simplifiedPath); | ||
| simplifiedPath.add(path.get(path.size() - 1)); | ||
|
|
||
| return simplifiedPath; | ||
| } | ||
|
|
||
| private static void simplifyRecursive(List<Point> path, int start, int end, double tolerance, List<Point> simplifiedPath) { | ||
| double maxDistance = 0; | ||
| int index = 0; | ||
|
|
||
| for (int i = start + 1; i < end; i++) { | ||
| double distance = perpendicularDistance(path.get(i), path.get(start), path.get(end)); | ||
| if (distance > maxDistance) { | ||
| maxDistance = distance; | ||
| index = i; | ||
| } | ||
| } | ||
|
|
||
| if (maxDistance > tolerance) { | ||
| if (index - start > 1) { | ||
| simplifyRecursive(path, start, index, tolerance, simplifiedPath); | ||
| } | ||
| simplifiedPath.add(path.get(index)); | ||
| if (end - index > 1) { | ||
| simplifyRecursive(path, index, end, tolerance, simplifiedPath); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| private static double perpendicularDistance(Point point, Point start, Point end) { | ||
| double numerator = Math.abs((end.y() - start.y()) * point.x() - (end.x() - start.x()) * point.y() + end.x() * start.y() - end.y() * start.x()); | ||
| double denominator = Math.sqrt(Math.pow(end.y() - start.y(), 2) + Math.pow(end.x() - start.x(), 2)); | ||
| return numerator / denominator; | ||
| } | ||
| } |
Oops, something went wrong.