Examples of com.vividsolutions.jts.operation.distance.IndexedFacetDistance

com.vividsolutions.jts.operation.distance.IndexedFacetDistance

Computes the distance between the facets (segments and vertices) of two {@link Geometry}s using a Branch-and-Bound algorithm. The Branch-and-Bound algorithm operates over a traversal of R-trees built on the target and possibly also the query geometries.

This approach provides the following benefits:

Performance is improved due to the effects of the R-tree index and the pruning due to the Branch-and-Bound approach
The spatial index on the target geometry can be cached to allow reuse in an incremental query situation.

Using this technique can be much more performant than using {@link #getDistance(Geometry)} when one or both input geometries are large, or when evaluating many distance computations against a single geometry.

This class is not thread-safe. @author Martin Davis

    }
  }


  void computeDistance(Geometry[] pts, Geometry geom)
  {
    IndexedFacetDistance bbd = null;
    if (USE_INDEXED_DIST)
      bbd = new IndexedFacetDistance(geom);
    for (int i = 0; i < pts.length; i++ ) {
      if (USE_INDEXED_DIST) {
        double dist = bbd.getDistance(pts[i]);
//        double dist = bbd.getDistanceWithin(pts[i].getCoordinate(), 100000);
      }
      else { 
       double dist = geom.distance(pts[i]);
      }

  void computeDistanceToAllPoints(Geometry[] geom)
  {
    Coordinate[] pts = geom[1].getCoordinates();
    double dist = 0.0;
    double dist2 = 0.0;
    IndexedFacetDistance fastDist = new IndexedFacetDistance(geom[0]);
    for (int i = 0; i < pts.length; i++) {
      Coordinate p = pts[i];
      
      // slow N^2 distance
      dist = geom[0].distance(geom[1].getFactory().createPoint(p));

Examples of com.vividsolutions.jts.operation.distance.IndexedFacetDistance

Related Classes of com.vividsolutions.jts.operation.distance.IndexedFacetDistance