/*
* Copyright (c) 2010 Georgios Migdos <cyberpython@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package org.geogebra.common.kernel.discrete.geom.algorithms.intersections;
import org.geogebra.common.kernel.discrete.geom.Point2D;
import org.geogebra.common.kernel.discrete.geom.Segment2D;
/**
*
* @author cyberpython
*/
public class Segment2DEx extends Segment2D {
public Segment2DEx(Point2D p0, Point2D p1) {
super(p0, p1);
}
public Point2D getLeftEndPoint() {
Point2D p0 = getStart();
Point2D p1 = getEnd();
double x0 = p0.getX();
double x1 = p1.getX();
if (x0 < x1) {
return new LeftEndPoint(p0.getX(), p0.getY(), this);
}
return new LeftEndPoint(p1.getX(), p1.getY(), this);
}
public Point2D getRightEndPoint() {
Point2D p0 = getStart();
Point2D p1 = getEnd();
double x0 = p0.getX();
double x1 = p1.getX();
if (x0 >= x1) {
return new RightEndPoint(p0.getX(), p0.getY(), this);
}
return new RightEndPoint(p1.getX(), p1.getY(), this);
}
}