Package org.geotools.geometry.iso.topograph2D

Examples of org.geotools.geometry.iso.topograph2D.Edge


    computeIntersections(si);
  }

  private void add(List edges) {
    for (Iterator i = edges.iterator(); i.hasNext();) {
      Edge edge = (Edge) i.next();
      // edge is its own group
      add(edge, edge);
    }
  }
View Full Code Here


    }
  }

  private void add(List edges, Object edgeSet) {
    for (Iterator i = edges.iterator(); i.hasNext();) {
      Edge edge = (Edge) i.next();
      add(edge, edgeSet);
    }
  }
View Full Code Here

   *
   * @param argIndex
   */
  private void computeIntersectionNodes(int argIndex) {
    for (Iterator i = this.arg[argIndex].getEdgeIterator(); i.hasNext();) {
      Edge e = (Edge) i.next();
      int eLoc = e.getLabel().getLocation(argIndex);
      for (Iterator eiIt = e.getEdgeIntersectionList().iterator(); eiIt
          .hasNext();) {
        EdgeIntersection ei = (EdgeIntersection) eiIt.next();
        RelateNode n = (RelateNode) this.nodes.addNode(ei.coord);
        if (eLoc == Location.BOUNDARY)
          n.setLabelBoundary(argIndex);
View Full Code Here

   * either self-intersections or mutual intersections to be labelled.
   * Endpoint nodes will already be labelled from when they were inserted.
   */
  private void labelIntersectionNodes(int argIndex) {
    for (Iterator i = arg[argIndex].getEdgeIterator(); i.hasNext();) {
      Edge e = (Edge) i.next();
      int eLoc = e.getLabel().getLocation(argIndex);
      for (Iterator eiIt = e.getEdgeIntersectionList().iterator(); eiIt
          .hasNext();) {
        EdgeIntersection ei = (EdgeIntersection) eiIt.next();
        RelateNode n = (RelateNode) nodes.find(ei.coord);
        if (n.getLabel().isNull(argIndex)) {
          if (eLoc == Location.BOUNDARY)
View Full Code Here

   * @param IntersectionMatrix
   */
  private void updateIM(IntersectionMatrix im) {

    for (Iterator ei = isolatedEdges.iterator(); ei.hasNext();) {
      Edge e = (Edge) ei.next();
      e.updateIM(im);
    }

    for (Iterator ni = nodes.iterator(); ni.hasNext();) {
      RelateNode node = (RelateNode) ni.next();
      //System.out.println(node.getCoordinate());
View Full Code Here

   * @param thisIndex
   * @param targetIndex
   */
  private void labelIsolatedEdges(int thisIndex, int targetIndex) {
    for (Iterator ei = arg[thisIndex].getEdgeIterator(); ei.hasNext();) {
      Edge e = (Edge) ei.next();
      if (e.isIsolated()) {
        this.labelIsolatedEdge(e, targetIndex, arg[targetIndex]
            .getGeometry());
        isolatedEdges.add(e);
      }
    }
View Full Code Here

  }

  public List computeEdgeEnds(Iterator edges) {
    List l = new ArrayList();
    for (Iterator i = edges; i.hasNext();) {
      Edge e = (Edge) i.next();
      this.computeEdgeEnds(e, l);
    }
    return l;
  }
View Full Code Here

   * <p>
   * Precondition: edge intersections have been computed.
   */
  public void computeIntersectionNodes(GeometryGraph geomGraph, int argIndex) {
    for (Iterator edgeIt = geomGraph.getEdgeIterator(); edgeIt.hasNext();) {
      Edge e = (Edge) edgeIt.next();
      int eLoc = e.getLabel().getLocation(argIndex);
      for (Iterator eiIt = e.getEdgeIntersectionList().iterator(); eiIt
          .hasNext();) {
        EdgeIntersection ei = (EdgeIntersection) eiIt.next();
        RelateNode n = (RelateNode) nodes.addNode(ei.coord);
        if (eLoc == Location.BOUNDARY)
          n.setLabelBoundary(argIndex);
View Full Code Here

TOP

Related Classes of org.geotools.geometry.iso.topograph2D.Edge

Copyright © 2018 www.massapicom. 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.