How to use

covers

method

in

com.vividsolutions.jts.geom.Geometry

/**
 * Default implementation.
 */
public boolean covers(Geometry g)
{
 return baseGeom.covers(g);
}

return g.covers(this);

/**
 * Computes the full topological <tt>covers</tt> predicate.
 * Used when short-circuit tests are not conclusive.
 * 
 * @param geom the test geometry
 * @return true if this prepared polygon covers the test geometry
 */
protected boolean fullTopologicalPredicate(Geometry geom)
{
  boolean result = prepPoly.getGeometry().covers(geom);
  return result;
}
 

/**
 * Default implementation.
 */
public boolean covers(Geometry g)
{
 return baseGeom.covers(g);
}

public boolean covers(Geometry g) {
  return geometry.covers(g);
}

  /**
   * Returns true if no point in geometry B is outside geometry A.
   *
   * @param geomA Geometry A
   * @param geomB Geometry B
   * @return True if no point in geometry B is outside geometry A
   */
  public static Boolean covers(Geometry geomA, Geometry geomB) {
    if(geomA == null||geomB == null){
      return null;
    }
    return geomA.covers(geomB);
  }
}

  /**
   * Returns true if no point in geometry B is outside geometry A.
   *
   * @param geomA Geometry A
   * @param geomB Geometry B
   * @return True if no point in geometry B is outside geometry A
   */
  public static Boolean covers(Geometry geomA, Geometry geomB) {
    if(geomA == null||geomB == null){
      return null;
    }
    return geomA.covers(geomB);
  }
}

return g.covers(this);

  public boolean match(Geometry spatialObject, Geometry queryWindow)
  {
    if (considerBoundaryIntersection) {
      if (queryWindow.intersects(spatialObject)) { return true; }
    }
    else {
      if (queryWindow.covers(spatialObject)) { return true; }
    }
    return false;
  }
}

  private boolean geoMatch(Geometry left, Geometry right)
  {
    //log.warn("Check "+left.toText()+" with "+right.toText());
    return considerBoundaryIntersection ? left.intersects(right) : left.covers(right);
  }
}

/**
 * Computes the full topological <tt>covers</tt> predicate.
 * Used when short-circuit tests are not conclusive.
 * 
 * @param geom the test geometry
 * @return true if this prepared polygon covers the test geometry
 */
protected boolean fullTopologicalPredicate(Geometry geom)
{
  boolean result = prepPoly.getGeometry().covers(geom);
  return result;
}
 

  private boolean geoMatch(Geometry left, Geometry right)
  {
    //log.warn("Check "+left.toText()+" with "+right.toText());
    return considerBoundaryIntersection ? left.intersects(right) : left.covers(right);
  }
}

  public boolean match(Geometry spatialObject, Geometry queryWindow)
  {
    if (considerBoundaryIntersection) {
      if (queryWindow.intersects(spatialObject)) { return true; }
    }
    else {
      if (queryWindow.covers(spatialObject)) { return true; }
    }
    return false;
  }
}

public static boolean covers(Object fieldValue, String geoString) {
  Geometry otherGeom = GeometryNormalizer.parseGeometry(geoString);
  Geometry thisGeom = getGeometryFromFieldValue(fieldValue);
  return thisGeom.covers(otherGeom);
}

if (geometry.covers(geometryFactory.createPoint(CoordUtils.createGeotoolsCoordinate(coord)))) {
  if (!measurePointPolygons.containsKey(measurePointId)) {
    measurePointPolygons.put(measurePointId, geometry);

/**
 *
 *  @param g1 Geometry instance or null
 *  @param g2 Geometry instance or null
 *  @return minimum distance in meters between two geometries
 */
private static Double distancePolygonPolygon(Geometry g1, Geometry g2) {
  Double distance = Double.MAX_VALUE;
  Double ringDistance;
  if (g1.covers(g2) || g2.covers(g1)) {
    return 0.0;
  }
  for (int i = 0; i < ((Polygon) g1).getExteriorRing().getNumPoints(); i++) {
    for (int j = 0; j < ((Polygon) g2).getExteriorRing().getNumPoints(); j++) {
      ringDistance = distancePointToPoint(((Polygon) g1).getExteriorRing().getPointN(i), ((Polygon) g2).getExteriorRing().getPointN(j));
      if (ringDistance < distance) {
        distance = ringDistance;
      }
    }
  }
  return distance;
}

/**
 *
 *  @param g1 Geometry instance or null
 *  @param g2 Geometry instance or null
 *  @return minimum distance in meters between two geometries
 */
private static Double distancePolygonPolygon(Geometry g1, Geometry g2) {
  Double distance = Double.MAX_VALUE;
  Double ringDistance;
  if (g1.covers(g2) || g2.covers(g1)) {
    return 0.0;
  }
  for (int i = 0; i < ((Polygon) g1).getExteriorRing().getNumPoints(); i++) {
    for (int j = 0; j < ((Polygon) g2).getExteriorRing().getNumPoints(); j++) {
      ringDistance = distancePointToPoint(((Polygon) g1).getExteriorRing().getPointN(i), ((Polygon) g2).getExteriorRing().getPointN(j));
      if (ringDistance < distance) {
        distance = ringDistance;
      }
    }
  }
  return distance;
}

public double getCoverage(Cell cell, boolean simpleIntersection) {
  checkPreparedShape();
  if (preparedShape == null) {
    if (simpleIntersection) {
      Geometry gm = makePoint(cell);
      return gm.intersects(value) ? 1.0 : 0.0;
    }
    Geometry gm = makeCell(cell.getMinX(), cell.getMinY(), cell.getMaxX(), cell
        .getMaxY());
    return gm.covers(value) ? 1.0
        : (gm.intersection(value).getArea() / gm.getArea());
  }
  if (simpleIntersection) {
    return preparedShape.covers(makePoint(cell)) ? 1 : 0;
  }
  Geometry gm = makeCell(cell.getMinX(), cell.getMinY(), cell.getMaxX(), cell
      .getMaxY());
  return preparedShape.covers(gm) ? 1.0
      : (gm.intersection(value).getArea() / gm.getArea());
}