Package com.vividsolutions.jts.index.bintree

Examples of com.vividsolutions.jts.index.bintree.Interval

57
58
59
60
61
62
63
64
65
66
67
  public List query(Interval searchInterval)
  {
    List result = new ArrayList();
    for (Iterator i = list.iterator(); i.hasNext(); ) {
      Interval interval = (Interval) i.next();
      if (interval.overlaps(searchInterval))
        result.add(interval);
    }
    return result;
  }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
    double gridInc = extent / gridSize;
    double cellSize = 2 * gridInc;

    for (int i = 0; i < gridSize; i++) {
        double x = MIN_EXTENT + gridInc * i;
        Interval interval = new Interval(x, x + cellSize   );
        btree.insert(interval, interval);
        intervalList.add(interval);
      }
  }
View Full Code Here
257
258
259
260
261
262
263
264
265
    node = getGraphBuilder().buildNode();
    setObject(node, c);
    getGraphBuilder().addNode(node);
    m_coord2node.put(c, node);
    if (useTolerance()) {
      spatialIndex.insert(new Interval(c.y, c.y), c);
    }
    return node;
  }
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
  // spatial search with tolerance
  private Node findClosestNodeWithinTolerance(Coordinate inCoord) {
    double closestDistance = Double.MAX_VALUE;
    Coordinate closestCoordinate = null;
    List<Coordinate> list = spatialIndex.query(new Interval(inCoord.y - tolerance, inCoord.y + tolerance));
    for (Coordinate c : list) {
      double distance = inCoord.distance(c);
      if (distance < closestDistance) {
        closestDistance = distance;
        closestCoordinate = c;
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
    double extent = MAX_EXTENT - MIN_EXTENT;
    double gridInc = extent / gridSize;

    for (int i = 0; i < gridSize; i++) {
        double x = MIN_EXTENT + gridInc * i;
        Interval interval = new Interval(x, x + cellSize);
        queryTest(interval);
        //queryTime(env);
    }
    System.out.println("Time = " + sw.getTimeString());
  }
View Full Code Here
145
146
147
148
149
150
151
152
153
154
  private List getOverlapping(List items, Interval searchInterval)
  {
    List result = new ArrayList();
    for (int i = 0; i < items.size(); i++) {
      Interval interval = (Interval) items.get(i);
      if (interval.overlaps(searchInterval)) result.add(interval);
    }
    return result;
  }
View Full Code Here
TOP

Related Classes of com.vividsolutions.jts.index.bintree.Interval

  • org.geotools.graph.build.line.BasicLineGraphGenerator
  • test.jts.index.BinTreeCorrectTest
  • test.jts.index.IntervalList
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.