mirror of https://github.com/octoleo/plantuml.git
75 lines
2.2 KiB
Java
75 lines
2.2 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2024, Arnaud Roques
|
|
*
|
|
* Project Info: https://plantuml.com
|
|
*
|
|
* If you like this project or if you find it useful, you can support us at:
|
|
*
|
|
* https://plantuml.com/patreon (only 1$ per month!)
|
|
* https://plantuml.com/paypal
|
|
*
|
|
* This file is part of PlantUML.
|
|
*
|
|
* PlantUML is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* PlantUML distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
|
* USA.
|
|
*
|
|
*
|
|
* Original Author: Arnaud Roques
|
|
*
|
|
*
|
|
*/
|
|
package net.sourceforge.plantuml.posimo;
|
|
|
|
import java.awt.geom.Line2D;
|
|
|
|
import net.sourceforge.plantuml.klimt.geom.XPoint2D;
|
|
|
|
public class TwoLinesIntersection {
|
|
|
|
private final XPoint2D inter;
|
|
|
|
public TwoLinesIntersection(Line2D lineA, Line2D lineB) {
|
|
final double x1 = lineA.getX1();
|
|
final double y1 = lineA.getY1();
|
|
final double x2 = lineA.getX2();
|
|
final double y2 = lineA.getY2();
|
|
final double x3 = lineB.getX1();
|
|
final double y3 = lineB.getY1();
|
|
final double x4 = lineB.getX2();
|
|
final double y4 = lineB.getY2();
|
|
|
|
final double den = (y4 - y3) * (x2 - x1) - (x4 - x3) * (y2 - y1);
|
|
|
|
final double uA1 = (x4 - x3) * (y1 - y3) - (y4 - y3) * (x1 - x3);
|
|
final double uA = uA1 / den;
|
|
|
|
// final double uB1 = (x2 - x1) * (y1 - y3) - (y2 - y1) * (x1 - x3);
|
|
// uB = uB1 / den;
|
|
|
|
final double x = x1 + uA * (x2 - x1);
|
|
final double y = y1 + uA * (y2 - y1);
|
|
|
|
inter = new XPoint2D(x, y);
|
|
}
|
|
|
|
public final XPoint2D getIntersection() {
|
|
return inter;
|
|
}
|
|
|
|
}
|