Java Geometry Algorithm extendLine(Point2D p0, Point2D p1, double toLength)

Description

extend Line

License

Open Source License

Declaration

public static void extendLine(Point2D p0, Point2D p1, double toLength) 

Method Source Code

//package com.java2s;
/*/*from w  w  w.j  a v a  2 s.  com*/
This program 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.
    
This program is 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 program.  If not, see <http://www.gnu.org/licenses/>.
Author: DarkLilac email:contact@darklilac.com
*/

import java.awt.geom.Point2D;

public class Main {
    public static void extendLine(Point2D p0, Point2D p1, double toLength) {
        final double oldLength = p0.distance(p1);
        final double lengthFraction = oldLength != 0.0 ? toLength / oldLength : 0.0;
        p1.setLocation(p0.getX() + (p1.getX() - p0.getX()) * lengthFraction,
                p0.getY() + (p1.getY() - p0.getY()) * lengthFraction);
    }
}

Related

1. dot(Point a, Point b, Point c)
2. dotNorm(final Point2D a, final Point2D b)
3. drag(Robot robot, Point startPoint, Point endPoint, int button)
4. dx(Point a, Point b)
5. edge(Collection points)
6. findArea(Point2D p1, Point2D p2, Point2D p3)
7. findDimension(Point2D[] pts)
8. findDistancedPoint(double t, Point2D sp, Point2D c1, Point2D c2, Point2D ep)
9. findIntersect(Point2D p1, Point2D p2, Point2D p3, Point2D p4)