Examples of SegmentIntersector

com.vividsolutions.jts.geomgraph.index.SegmentIntersector
Computes the intersection of line segments, and adds the intersection to the edges containing the segments. @version 1.7
org.geotools.geometry.iso.topograph2D.index.SegmentIntersector
Keeps informations about the intersections of Segments. Uses a LineIntersector to calculate the intersection between two line segments. @source $URL$

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

  private boolean isSimpleLinearGeometry(Geometry geom)
  {
    if (geom.isEmpty()) return true;
    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    if (! si.hasIntersection()) return true;
    if (si.hasProperIntersection()) {
      nonSimpleLocation = si.getProperIntersectionPoint();
      return false;
    }
    if (hasNonEndpointIntersection(graph)) return false;
    if (isClosedEndpointsInInterior) {
      if (hasClosedEndpointIntersection(graph)) return false;

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

  {
    /**
     * To fully check validity, it is necessary to
     * compute ALL intersections, including self-intersections within a single edge.
     */
    SegmentIntersector intersector = geomGraph.computeSelfNodes(li, true);
    if (intersector.hasProperIntersection()) {
      invalidPoint = intersector.getProperIntersectionPoint();
      return false;
    }


    nodeGraph.build(geomGraph);

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

    }
    arg[0].computeSelfNodes(li, false);
    arg[1].computeSelfNodes(li, false);


    // compute intersections between edges of the two input geometries
    SegmentIntersector intersector = arg[0].computeEdgeIntersections(arg[1], li, false);
//System.out.println("computeIM: # segment intersection tests: " + intersector.numTests);
    computeIntersectionNodes(0);
    computeIntersectionNodes(1);
    /**
     * Copy the labelling for the nodes in the parent Geometries.  These override

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

  private boolean isSimpleLinearGeometry(Geometry geom)
  {
    if (geom.isEmpty()) return true;
    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    if (! si.hasIntersection()) return true;
    if (si.hasProperIntersection()) {
      nonSimpleLocation = si.getProperIntersectionPoint();
      return false;
    }
    if (hasNonEndpointIntersection(graph)) return false;
    if (isClosedEndpointsInInterior) {
      if (hasClosedEndpointIntersection(graph)) return false;

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

    }
    arg[0].computeSelfNodes(li, false);
    arg[1].computeSelfNodes(li, false);


    // compute intersections between edges of the two input geometries
    SegmentIntersector intersector = arg[0].computeEdgeIntersections(arg[1], li, false);
//System.out.println("computeIM: # segment intersection tests: " + intersector.numTests);
    computeIntersectionNodes(0);
    computeIntersectionNodes(1);
    /**
     * Copy the labelling for the nodes in the parent Geometries.  These override

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

  private boolean isSimpleLinearGeometry(Geometry geom)
  {
    if (geom.isEmpty()) return true;
    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    if (! si.hasIntersection()) return true;
    if (si.hasProperIntersection()) {
      nonSimpleLocation = si.getProperIntersectionPoint();
      return false;
    }
    if (hasNonEndpointIntersection(graph)) return false;
    if (isClosedEndpointsInInterior) {
      if (hasClosedEndpointIntersection(graph)) return false;

View Full Code Here

Examples of com.vividsolutions.jts.geomgraph.index.SegmentIntersector

  private boolean isSimpleLinearGeometry(Geometry geom)
  {
    if (geom.isEmpty()) return true;
    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    if (! si.hasIntersection()) return true;
    if (si.hasProperIntersection()) {
      nonSimpleLocation = si.getProperIntersectionPoint();
      return false;
    }
    if (hasNonEndpointIntersection(graph)) return false;
    if (isClosedEndpointsInInterior) {
      if (hasClosedEndpointIntersection(graph)) return false;

View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.index.SegmentIntersector

    // if (geom.isEmpty())
    // return true;


    GeometryGraph graph = new GeometryGraph(0, geom);
    LineIntersector li = new RobustLineIntersector();
    SegmentIntersector si = graph.computeSelfNodes(li, true);
    // if no self-intersection, must be simple
    
    // Primitives can be simple even if their boundary intersect
    // Complexes are not simple if their boundary intersect
    // TODO Bedeutung der attribute checken und entsprechend anpassen!
    if (!si.hasIntersection())
      return true;
    if (si.hasProperIntersection())
      return false;
    if (this.hasNonEndpointIntersection(graph))
      return false;
    if (this.hasClosedEndpointIntersection(graph))
      return false;

View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.index.SegmentIntersector

   *         intersections found
   */
  public SegmentIntersector computeSelfNodes(LineIntersector li,
      boolean computeRingSelfNodes) {


    SegmentIntersector si = new SegmentIntersector(li, true, false);


    // get an instance for an edgeSetIntersector (here: MC Sweepline
    // Intersector)
    EdgeSetIntersector esi = this.createEdgeSetIntersector();

View Full Code Here

Examples of org.geotools.geometry.iso.topograph2D.index.SegmentIntersector

   * @param includeProper
   * @return
   */
  public SegmentIntersector computeEdgeIntersections(GeometryGraph g,
      LineIntersector li, boolean includeProper) {
    SegmentIntersector si = new SegmentIntersector(li, includeProper, true);
    si.setBoundaryNodes(this.getBoundaryNodes(), g.getBoundaryNodes());


    EdgeSetIntersector esi = createEdgeSetIntersector();
    esi.computeIntersections(edges, g.edges, si);
    /*
     * for (Iterator i = g.edges.iterator(); i.hasNext();) { Edge e = (Edge)

View Full Code Here

0 1

TOP

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.