Examples of com.vividsolutions.jts.geom.Geometry

com.vividsolutions.jts.geom.Geometry
The base class for all geometric objects.

Binary Predicates
Because it is not clear at this time what semantics for spatial analysis methods involving GeometryCollections would be useful, GeometryCollections are not supported as arguments to binary predicates (other than convexHull) or the relate method.
Set-Theoretic Methods
The spatial analysis methods will return the most specific class possible to represent the result. If the result is homogeneous, a Point, LineString, or Polygon will be returned if the result contains a single element; otherwise, a MultiPoint, MultiLineString, or MultiPolygon will be returned. If the result is heterogeneous a GeometryCollection will be returned.
Because it is not clear at this time what semantics for set-theoretic methods involving GeometryCollections would be useful, GeometryCollections are not supported as arguments to the set-theoretic methods.
Representation of Computed Geometries
The SFS states that the result of a set-theoretic method is the "point-set" result of the usual set-theoretic definition of the operation (SFS 3.2.21.1). However, there are sometimes many ways of representing a point set as a Geometry.
The SFS does not specify an unambiguous representation of a given point set returned from a spatial analysis method. One goal of JTS is to make this specification precise and unambiguous. JTS will use a canonical form for Geometrys returned from spatial analysis methods. The canonical form is a Geometry which is simple and noded:
- Simple means that the Geometry returned will be simple according to the JTS definition of isSimple.
- Noded applies only to overlays involving LineStrings. It means that all intersection points on LineStrings will be present as endpoints of LineStrings in the result.
This definition implies that non-simple geometries which are arguments to spatial analysis methods must be subjected to a line-dissolve process to ensure that the results are simple.
Constructed Points And The Precision Model
The results computed by the set-theoretic methods may contain constructed points which are not present in the input Geometry s. These new points arise from intersections between line segments in the edges of the input Geometrys. In the general case it is not possible to represent constructed points exactly. This is due to the fact that the coordinates of an intersection point may contain twice as many bits of precision as the coordinates of the input line segments. In order to represent these constructed points explicitly, JTS must truncate them to fit the PrecisionModel.
Unfortunately, truncating coordinates moves them slightly. Line segments which would not be coincident in the exact result may become coincident in the truncated representation. This in turn leads to "topology collapses" -- situations where a computed element has a lower dimension than it would in the exact result.
When JTS detects topology collapses during the computation of spatial analysis methods, it will throw an exception. If possible the exception will report the location of the collapse.
#equals(Object) and #hashCode are not overridden, so that when two topologically equal Geometries are added to HashMaps and HashSets, they remain distinct. This behaviour is desired in many cases. @version 1.7


        GeometryDescriptor geomAttr = store.getSchema().getGeometryDescriptor();
        Class< ? extends Geometry> expectedClass = (Class< ? extends Geometry>) geomAttr.getType()
                .getBinding();


        Geometry adaptedGeom = GeometryUtil.adapt(newGeometry, expectedClass);


        FilterFactory ff = CommonFactoryFinder.getFilterFactory(null);
        FeatureId fid = ff.featureId(fidToUpdate);
        Set<FeatureId> ids = new HashSet<FeatureId>(1);
        ids.add(fid);

View Full Code Here

            public SimpleFeatureType getFeatureType() {
                return newSchema;
            }
            
            private Geometry diff(SimpleFeature f) {
                Geometry geom = (Geometry) f.getDefaultGeometry();
                FeatureIterator<SimpleFeature> i = diffFeatures.features();
                try {
                    while (i.hasNext()) {
                        SimpleFeature diff = i.next();
                        Geometry g = geom.difference((Geometry) diff.getDefaultGeometry());
                        if (g.isEmpty()) {
                            return null;
                        }
                        geom = g;
                    }
                } finally {
                    i.close();
                }
                return geom;
            }
            
            public SimpleFeature next() throws IOException, IllegalAttributeException, NoSuchElementException {
                SimpleFeature source=iter.next();
                Geometry geom = diff(source);
                if (geom == null || !hasNextCalled) {
                    throw new NoSuchElementException("Use hasNext()."); //$NON-NLS-1$
                }
                
                if (geom instanceof LineString) {
                    geom = geom.getFactory().createMultiLineString(new LineString[] {(LineString) geom});
                }
                if (geom instanceof Polygon) {
                    geom = geom.getFactory().createMultiPolygon(new Polygon[]{(Polygon) geom});
                }
                source.setDefaultGeometry(geom);
                
                hasNextCalled = false;
                return source;
            }


            public boolean hasNext() throws IOException {
                if (hasNextCalled) {
                    return iter.hasNext();
                }


                // pointer chase forward to the next different geometry
                try {
                    Geometry g = null;
                    while (g == null) {
                        if (!peek.hasNext()) {
                            return false;
                        }
                        SimpleFeature f = peek.next();

View Full Code Here

    assert this.line != null : "the line can't be null"; //$NON-NLS-1$
    assert this.gf != null : "the geometry factory can't be null"; //$NON-NLS-1$


    // use the Polygonizer to get the rings.
    List<Geometry> ringList = new ArrayList<Geometry>();
    Geometry multiLines =this.line.union();
    Polygonizer polygonizer = new Polygonizer();
    polygonizer.add(multiLines);
    Collection<Polygon> polyCollection = polygonizer.getPolygons();


    // add the rings to the ringList.
    for (Polygon pol : polyCollection) {


      Coordinate[] polCoord = pol.getExteriorRing().getCoordinates();


      LinearRing polygonRing = this.gf.createLinearRing(polCoord);
      ringList.add(polygonRing);
    }


    // get the remaining line.
    Geometry result = getRemainingLine(line.getCoordinates(), ringList);


    // create the output data.
    ResultRingExtractor outputData = new ResultRingExtractor(result, ringList);
    return outputData;
  }

View Full Code Here

   */
  private Geometry getRemainingLine(Coordinate[] originalCoord, List<Geometry> ringList) {


    List<Geometry> segmentsToAdd = new LinkedList<Geometry>();
    // apply the difference operation.
    Geometry result = this.line;
    for (Geometry ring : ringList) {


      result = result.difference(ring);
    }
    // union for nodded multilineStrings.
    result = SplitUtil.buildLineUnion(result);
    // seek for overlapped segments.
    for (int i = 0; i < originalCoord.length - 1; i++) {

View Full Code Here

   * @return The segments nodded to the actualResultLine if they can be
   *         nodded.
   */
  private Geometry nodSegments(List<Geometry> segmentsToAdd, List<Geometry> ringList, Geometry actualResultLine) {


    Geometry result = actualResultLine;
    // check if that lineString exist or is contained in any of
    // the rings.
    for (Geometry segment : segmentsToAdd) {


      assert segment.getCoordinates().length == 2 : "the segment should have 2 coordinates."; //$NON-NLS-1$

View Full Code Here


    assert line instanceof LineString || line instanceof MultiLineString : "Split line must be a line."; //$NON-NLS-1$
    assert geomToAddVertex instanceof Polygon || geomToAddVertex instanceof LineString
          || geomToAddVertex instanceof MultiPolygon || geomToAddVertex instanceof MultiLineString : "Input geometry has unexpected class."; //$NON-NLS-1$


    Geometry result = null;


    if (geomToAddVertex instanceof Polygon || geomToAddVertex instanceof MultiPolygon) {


      Polygon polygon;
      // cast to polygon, we know that geomToAddVertex only has one

View Full Code Here

   */
  private static Geometry addIntersectionVertexToPolygon(  Geometry polygonToAddVertex,
                              Geometry line,
                              List<Geometry> geomNeighborList) {


    Geometry result = null;


    Geometry[] holes = null;
    LinearRing[] holesRing = null;
    List<Coordinate> shellCoordinates = null;
    List<LinearRing> holesList = null;
    GeometryFactory fc = polygonToAddVertex.getFactory();


    // cast to polygon and get the exterior boundary.
    Polygon polygonGeom = (Polygon) polygonToAddVertex;
    Geometry boundary = polygonGeom.getExteriorRing();


    Coordinate[] shellClosed = null;
    Coordinate[] boundaryCoordinates = boundary.getCoordinates();


    // for each neighbor
    for (Geometry neighbor : geomNeighborList) {


      if (boundary.touches(neighbor)) {
        // store the modified boundaryCoordinates for add more vertex if
        // there are.
        shellCoordinates = addIntersection(boundaryCoordinates, line, fc, neighbor);
        boundaryCoordinates = shellCoordinates.toArray(new Coordinate[shellCoordinates.size()]);
        shellClosed = boundaryCoordinates;

View Full Code Here

   *            The split line.
   * @return the geomToAddVertex with the intersection vertex added.
   */
  private static Geometry addIntersectionVertexToLine(Geometry lineToAddVertex, Geometry line) {


    Geometry result = null;


    List<Coordinate> shellCoordinates = null;
    GeometryFactory fc = lineToAddVertex.getFactory();
    Geometry boundary = lineToAddVertex.getBoundary();


    Coordinate[] boundaryCoordinates = boundary.getCoordinates();


    // add the intersection vertex to the shellCoordinates.
    shellCoordinates = addIntersection(boundaryCoordinates, line, fc, line);


    Coordinate[] shellClosed = shellCoordinates.toArray(new Coordinate[shellCoordinates.size()]);

View Full Code Here


    List<LinearRing> holesRing = new ArrayList<LinearRing>();
    List<Coordinate> holeCoordinates = null;
    for (int i = 0; i < holes.length; i++) {


      Geometry eachHole = fc.createLinearRing(holes[i].getCoordinates());
      Coordinate[] boundaryCoordinates = eachHole.getCoordinates();
      Coordinate[] holeClosed = null;


      for (Geometry neighbor : geomNeighborList) {


        // if it touch, add the intersection vertex.
        if (eachHole.touches(neighbor)) {


          // store the modified boundaryCoordinates for add more
          // vertex if there are.
          holeCoordinates = addIntersection(boundaryCoordinates, line, fc, neighbor);
          boundaryCoordinates = holeCoordinates.toArray(new Coordinate[holeCoordinates.size()]);

View Full Code Here

      LineString segment = fc.createLineString(segmentCoordinates);
      // if intersect, this is the vertex we need to add, so add it to the
      // result coordinates list.
      if (segment.intersects(line)) {


        Geometry point = segment.intersection(line);


        Geometry[] sorted = sortPoints(point, segment);
        // add all the points.
        for (int j = 0; j < sorted.length; j++) {

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of com.vividsolutions.jts.geom.Geometry

edu.isi.karma.geospatial.SpatialReferenceSystemTransformationUtil

es.udig.tools.geometry.split.RingExtractorTest

es.udig.tools.geometry.split.SplitBuilderTest

es.udig.tools.geometry.split.SplitMultiPolygonTest

es.udig.tools.geometry.split.SplitStrategyTest

es.udig.tools.geometry.split.SplitTestUtil

es.udig.tools.geometry.split.Testcatalog_20100414

org.exist.indexing.spatial.GMLHSQLIndexWorker

org.geotools.arcsde.data.SpatialFilterTest

org.geotools.coverage.processing.operation.Crop

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.

Examples of com.vividsolutions.jts.geom.Geometry

Binary Predicates

Set-Theoretic Methods

Representation of Computed Geometries

Constructed Points And The Precision Model

Related Classes of com.vividsolutions.jts.geom.Geometry