com.vividsolutions.jts.geomgraph.index.SweepLineSegment Maven / Gradle / Ivy
/*
* The JTS Topology Suite is a collection of Java classes that
* implement the fundamental operations required to validate a given
* geo-spatial data set to a known topological specification.
*
* Copyright (C) 2001 Vivid Solutions
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* For more information, contact:
*
* Vivid Solutions
* Suite #1A
* 2328 Government Street
* Victoria BC V8T 5G5
* Canada
*
* (250)385-6040
* www.vividsolutions.com
*/
package com.vividsolutions.jts.geomgraph.index;
import com.vividsolutions.jts.geom.Coordinate;
import com.vividsolutions.jts.geomgraph.*;
/**
* @version 1.7
*/
public class SweepLineSegment {
Edge edge;
Coordinate[] pts;
int ptIndex;
public SweepLineSegment(Edge edge, int ptIndex) {
this.edge = edge;
this.ptIndex = ptIndex;
pts = edge.getCoordinates();
}
public double getMinX()
{
double x1 = pts[ptIndex].x;
double x2 = pts[ptIndex + 1].x;
return x1 < x2 ? x1 : x2;
}
public double getMaxX()
{
double x1 = pts[ptIndex].x;
double x2 = pts[ptIndex + 1].x;
return x1 > x2 ? x1 : x2;
}
public void computeIntersections(SweepLineSegment ss, SegmentIntersector si)
{
si.addIntersections(edge, ptIndex, ss.edge, ss.ptIndex);
}
}