Examples of com.vividsolutions.jts.geom.Geometry.intersection()

Class com.vividsolutions.jts.geom.Geometry

Examples of com.vividsolutions.jts.geom.Geometry.intersection()

com.vividsolutions.jts.geom.Geometry.intersection()
Computes a Geometry representing the points shared by this Geometry and other. {@link GeometryCollection}s support intersection with homogeneous collection types, with the semantics that the result is a {@link GeometryCollection} of theintersection of each element of the target with the argument. @param other the Geometry with which to compute the intersection @return the points common to the two Geometrys @throws TopologyException if a robustness error occurs @throws IllegalArgumentException if the argument is a non-empty GeometryCollection


    // limit based on authorizations
    for (Authentication authentication : authentications) {
      for (BaseAuthorization authorization : authentication.getAuthorizations()) {
        if (authorization instanceof AreaAuthorization) {
          geometry = geometry.intersection(areaGetter.get((AreaAuthorization) authorization));
        }
      }
    }
    geometry.setSRID(srid); // force srid, even when not set correctly by security service
    return geometry;

View Full Code Here

      Polygon jtsPoly = polygonXZToJTSPolygon(poly);
      
      if (remainingGeometry == null) {
        remainingGeometry = jtsPoly;
      } else {
        remainingGeometry = remainingGeometry.intersection(jtsPoly);
      }
      
    }
    
    return polygonsXZFromJTSGeometry(remainingGeometry);

View Full Code Here


            for (int j = 0; j < polygon.getNumInteriorRing(); j++) {


                Geometry ring = polygon.getInteriorRingN(j);


                intersection = ring.intersection(segment);
                // find the closest one to shortCoords[i]
                for (int h = 0; h < intersection.getNumGeometries(); h++) {


                    Coordinate pointToTest = intersection.getGeometryN(h).getCoordinate();

View Full Code Here

    
    long startTime;
    long endTime;


    System.out.println();
    System.out.println( "Where intersection of simple polygon is: " + boundingBox.intersection( this.simplePolygon ) + " ..." );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      this.simplePolygon.intersection( boundingBox );

View Full Code Here

    System.out.println( "Intersection on polygon: " + (endTime - startTime) + " ms" );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      boundingBox.intersection( this.simplePolygon );
    }
    endTime = System.currentTimeMillis();
    System.out.println( "Intersection on bounding box: " + (endTime - startTime) + " ms" );
  }

View Full Code Here

    
    long startTime;
    long endTime;


    System.out.println();
    System.out.println( "Where intersection of simple polygon is: " + boundingBox.intersection( this.simplePolygon ) + " ..." );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      this.simplePolygon.intersection( boundingBox );

View Full Code Here

    System.out.println( "Intersection on polygon: " + (endTime - startTime) + " ms" );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      boundingBox.intersection( this.simplePolygon );
    }
    endTime = System.currentTimeMillis();
    System.out.println( "Intersection on bounding box: " + (endTime - startTime) + " ms" );
  }

View Full Code Here

    
    long startTime;
    long endTime;


    System.out.println();
    System.out.println( "Where intersection of complex polygon is: " + boundingBox.intersection( this.complexPolygon ) + " ..." );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      this.complexPolygon.intersection( boundingBox );

View Full Code Here

    System.out.println( "Intersection on polygon: " + (endTime - startTime) + " ms" );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      boundingBox.intersection( this.complexPolygon );
    }
    endTime = System.currentTimeMillis();
    System.out.println( "Intersection on bounding box: " + (endTime - startTime) + " ms" );
  }

View Full Code Here

    
    long startTime;
    long endTime;


    System.out.println();
    System.out.println( "Where intersection of complex polygon is: " + boundingBox.intersection( this.complexPolygon ) + " ..." );
    
    startTime = System.currentTimeMillis();
    for (int i=0; i<REPEAT_COUNT; i++)
    {
      this.complexPolygon.intersection( boundingBox );

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.