Examples of equals2D()


Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

    for (Iterator<DirectedEdge> it = edges.iterator(); it.hasNext();) {
      DirectedEdge edge = (DirectedEdge) it.next();
      if (!nodeCoord.equals2D(edge.getCoordinate())) {
        edge = edge.getSym();
      }
      assert nodeCoord.equals2D(edge.getCoordinate());
      outgoingEdges.add(edge);
    }
    return outgoingEdges;
  }
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

    assert edge != null : "edge can not be null"; //$NON-NLS-1$
    assert getDegree() >= 2 : "there must be at least two edges in the edge star" + " :" + ((SplitEdge) edge.getEdge()).toString(); //$NON-NLS-1$ //$NON-NLS-2$

    final Coordinate nodeCoord = getCoordinate();

    assert nodeCoord.equals2D(edge.getCoordinate());

    double acutestAngle = Double.MAX_VALUE;
    DirectedEdge acutest = null;
    DirectedEdge adjacentEdge = null;
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

     * This check catches cases where the ring contains an A-B-A configuration
     * of points. This can happen if the ring does not contain 3 distinct points
     * (including the case where the input array has fewer than 4 elements), or
     * it contains coincident line segments.
     */
    if (prev.equals2D(hiPt) || next.equals2D(hiPt) || prev.equals2D(next))
      return false;

    int disc = computeOrientation(prev, hiPt, next);

    /**
 
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

    double minDist = Double.MAX_VALUE;
    for (Iterator i = result.iterator(); i.hasNext();) {
      KdNode nextNode = (KdNode) i.next();
      Coordinate testPt = nextNode.getCoordinate();
      // ignore segment endpoints
      if (testPt.equals2D(p) || testPt.equals2D(q))
        continue;

      double testRadius = midPt.distance(testPt);
      if (testRadius < segRadius) {
        // double testDist = seg.distance(testPt);
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

    double minDist = Double.MAX_VALUE;
    for (Iterator i = result.iterator(); i.hasNext();) {
      KdNode nextNode = (KdNode) i.next();
      Coordinate testPt = nextNode.getCoordinate();
      // ignore segment endpoints
      if (testPt.equals2D(p) || testPt.equals2D(q))
        continue;

      double testRadius = midPt.distance(testPt);
      if (testRadius < segRadius) {
        // double testDist = seg.distance(testPt);
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

     * This check catches cases where the ring contains an A-B-A configuration
     * of points. This can happen if the ring does not contain 3 distinct points
     * (including the case where the input array has fewer than 4 elements), or
     * it contains coincident line segments.
     */
    if (prev.equals2D(hiPt) || next.equals2D(hiPt) || prev.equals2D(next))
      return false;

    int disc = computeOrientation(prev, hiPt, next);

    /**
 
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

        if (coordinateList.size() > 1) {
            Coordinate firstCoordinate = (Coordinate) coordinateList.get(0);
            Coordinate lastCoordinate = (Coordinate) coordinateList.get(coordinateList
                    .size() - 1);

            if (lastCoordinate.equals2D(firstCoordinate)) {
                return true;
            } else {
                return false;
            }
        } else {
View Full Code Here

Examples of com.vividsolutions.jts.geom.Coordinate.equals2D()

  }

  protected LineSegment alterLine(LineSegment line, Node n1, Node n2) {
    Coordinate c1added = ((Coordinate) n1.getObject());
    Coordinate c2added = ((Coordinate) n2.getObject());
      if (!c1added.equals2D(line.p0) || c2added.equals2D(line.p1)) {
        return new LineSegment(c1added,c2added);
      }
      return line;
  }
View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.Coordinate.equals2D()

     * This check catches cases where the ring contains an A-B-A
     * configuration of points. This can happen if the ring does not contain
     * 3 distinct points (including the case where the input array has fewer
     * than 4 elements), or it contains coincident line segments.
     */
    if (prev.equals2D(hiPt) || next.equals2D(hiPt) || prev.equals2D(next))
      return false;

    int disc = computeOrientation(prev, hiPt, next);

    /**
 
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.