Package chunmap.model.relate

Examples of chunmap.model.relate.ComputeIm

119
120
121
122
123
124
125
126
127
128
129
130
131
    }
    for (int i = 0, n = holes.size(); i < n; i++) {
      for (int j = i + 1; j < n; j++) {
        Ring r1 = holes.get(i);
        Ring r2 = holes.get(i);
        ComputeIm ac = new Polygon_Polygon(r1.toPolygon(), r2
            .toPolygon());
        if (ac.getIM().get(IntersectionMatrix.Inner,
            IntersectionMatrix.Inner) != IntersectionMatrix.EmptyDim) {
          return false;
        }
      }
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
    for (LineString ls : lineStrings) {
      Fragment fra = new Fragment();
      fra.setLineString(ls);

      ComputeIm cim = ComputeImFactory.getInstance().getImComputer(ls,
          other);
      IntersectionMatrix im = cim.getIM();
      boolean isWithin = isWithin(im);
      boolean isBorder = isOnBorder(im);

      if (isBorder) {
        fra.setContainIn(Fragment.Border);
View Full Code Here
28
29
30
31
32
33
34
35
36
37
    WktReader wkt = new WktReader();
    Geometry g = wkt.read("LINESTRING(1 2,3 1,4 0,3 -2,0 0,1 2)");
    Ring lr = ((LineString) g).toLinearRing();
    GeoPoint p1 = new GeoPoint(1, 0);

    ComputeIm p2r = new Point_LinearRing(p1, lr);
    IntersectionMatrix rt = p2r.getIM();

    assertTrue(rt.match(IntersectionMatrix.WithinsPattern));
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
    WktReader wkt = new WktReader();
    Geometry g = wkt.read("LINESTRING(1 2,3 1,4 0,3 -2,0 0,1 2)");
    Ring lr = ((LineString) g).toLinearRing();
    GeoPoint p1 = new GeoPoint(2, 2);

    ComputeIm p2r = new Point_LinearRing(p1, lr);
    IntersectionMatrix rt = p2r.getIM();

    assertTrue(rt.match(IntersectionMatrix.DisjointPattern));
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
  @Override
  protected int inner2innerDim(Geometry g1, Geometry g2) {
    LineString l1 = (LineString) g1;
    Polygon a2 = (Polygon) g2;

    ComputeIm l2r = new LineString_LinearRing(l1, a2.getShell());
    IntersectionMatrix tim = l2r.getIM();

    if (tim.get(Inner, Inner) == EmptyDim)
      return EmptyDim;

    if (a2.inHoles(l1)) {
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
    if (!a2.getShell().containLineStringIn(l1)) {
      return false;
    }

    for (Ring r : a2.getHoles()) {
      ComputeIm l2r = new LineString_LinearRing(l1, r);
      IntersectionMatrix tim = l2r.getIM();
      if (tim.get(Inner, Inner) != EmptyDim) {
        return false;
      }
    }
    return true;
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
40
41
  @Override
  protected int inner2innerDim(Geometry g1, Geometry g2) {
    Polygon a1 = (Polygon) g1;
    Polygon a2 = (Polygon) g2;
    ComputeIm r2r = new LinearRing_LinearRing(a1.getShell(), a2
        .getShell());
    IntersectionMatrix tim = r2r.getIM();
    if (tim.get(Inner, Inner) != EmptyDim) {
      if (!inHoles(a1.getShell(), a2) && !inHoles(a2.getShell(), a1))
        return AreaDim;
    }
    return EmptyDim;
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
    if (im.get(Inner, Inner) == EmptyDim)
      return false;

    Polygon a1 = (Polygon) g1;
    Polygon a2 = (Polygon) g2;
    ComputeIm r2r = new LinearRing_LinearRing(a1.getShell(), a2
        .getShell());
    IntersectionMatrix tim = r2r.getIM();

    if (tim.get(Inner, Outer) != EmptyDim)
      return false;

    for (Ring r2 : a2.getHoles()) {
      ComputeIm r2r2 = new LinearRing_LinearRing(a1.getShell(), r2);
      IntersectionMatrix tim2 = r2r2.getIM();
      if (tim2.get(Inner, Inner) != EmptyDim)
        if (inHoles(r2, a1))
          return false;
    }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
  @Test
  public void testComputeIM() {
    GeoPoint p1 = new GeoPoint(1, 2);
    GeoPoint p2 = new GeoPoint(1, 0);

    ComputeIm r = new Point_Point(p1, p2);
    IntersectionMatrix rt = r.getIM();

    assertTrue(rt.match(IntersectionMatrix.DisjointPattern));
  }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
  @Test
  public void testComputeIM2() {
    GeoPoint p1 = new GeoPoint(1, 2);
    GeoPoint p2 = new GeoPoint(1, 2);

    ComputeIm r = new Point_Point(p1, p2);
    IntersectionMatrix rt = r.getIM();

    assertFalse(rt.match(IntersectionMatrix.DisjointPattern));
  }
View Full Code Here
TOP

Related Classes of chunmap.model.relate.ComputeIm

  • chunmap.model.elem.Envelope
  • chunmap.model.geom.Polygon
  • chunmap.model.operate.overlay.FragmentCollection
  • chunmap.model.relate.IntersectionMatrix
  • chunmap.model.relate.relateop.LineString_Polygon
  • chunmap.model.relate.relateop.Point_LinearRingTest
  • chunmap.model.relate.relateop.Point_PointTest
  • chunmap.model.relate.relateop.Polygon_Polygon
    • 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.