mirror of
https://github.com/octoleo/plantuml.git
synced 2024-06-09 11:42:43 +00:00
82 lines
2.7 KiB
Java
82 lines
2.7 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009, Arnaud Roques
|
|
*
|
|
* Project Info: http://plantuml.sourceforge.net
|
|
*
|
|
* 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 Lesser 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.
|
|
*
|
|
* [Java is a trademark or registered trademark of Sun Microsystems, Inc.
|
|
* in the United States and other countries.]
|
|
*
|
|
* Original Author: Arnaud Roques
|
|
*
|
|
* Revision $Revision: 4236 $
|
|
*
|
|
*/
|
|
package net.sourceforge.plantuml.posimo;
|
|
|
|
import java.awt.geom.Line2D;
|
|
import java.awt.geom.Point2D;
|
|
import java.awt.geom.Rectangle2D;
|
|
|
|
public class LineRectIntersection {
|
|
|
|
private final Point2D inter;
|
|
|
|
public LineRectIntersection(Line2D line, Rectangle2D rect) {
|
|
final Point2D p1 = new Point2D.Double(rect.getMinX(), rect.getMinY());
|
|
final Point2D p2 = new Point2D.Double(rect.getMaxX(), rect.getMinY());
|
|
final Point2D p3 = new Point2D.Double(rect.getMaxX(), rect.getMaxY());
|
|
final Point2D p4 = new Point2D.Double(rect.getMinX(), rect.getMaxY());
|
|
|
|
final Point2D inter1 = new LineSegmentIntersection(new Line2D.Double(p1, p2), line).getIntersection();
|
|
final Point2D inter2 = new LineSegmentIntersection(new Line2D.Double(p2, p3), line).getIntersection();
|
|
final Point2D inter3 = new LineSegmentIntersection(new Line2D.Double(p3, p4), line).getIntersection();
|
|
final Point2D inter4 = new LineSegmentIntersection(new Line2D.Double(p4, p1), line).getIntersection();
|
|
|
|
final Point2D o = line.getP1();
|
|
inter = getCloser(o, inter1, inter2, inter3, inter4);
|
|
|
|
}
|
|
|
|
public static Point2D getCloser(final Point2D o, final Point2D... other) {
|
|
double minDist = Double.MAX_VALUE;
|
|
Point2D result = null;
|
|
|
|
for (Point2D pt : other) {
|
|
if (pt != null) {
|
|
final double dist = pt.distanceSq(o);
|
|
if (dist < minDist) {
|
|
minDist = dist;
|
|
result = pt;
|
|
}
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
public final Point2D getIntersection() {
|
|
return inter;
|
|
}
|
|
|
|
}
|