Package chunmap.model.relate

Examples of chunmap.model.relate.IntersectionMatrix

30
31
32
33
34
35
36
37
38
    Geometry g2 = wkt.read("LINESTRING(1 1,1 2,2 2,3 2)");
    LineString ls = (LineString) g2;

    // IntersectionMatrix rt2 = ComputeIm.getInstance().getIM(ls, pg);
    LineString_Polygon l2a = new LineString_Polygon(ls, pg);
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.match(IntersectionMatrix.CrossesPattern));

  }
View Full Code Here
47
48
49
50
51
52
53
54
55
        .read("LINESTRING(1.0 0.5,3.0 0.5,3.5 0.0,3.0 -1.0,1.0 0.0,1.0 0.5)");
    LineString ls = (LineString) g2;

    // IntersectionMatrix rt = ComputeIm.getInstance().getIM(ls, pg);
    LineString_Polygon l2a = new LineString_Polygon(ls, pg);
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.match(IntersectionMatrix.DisjointPattern));

  }
View Full Code Here
64
65
66
67
68
69
70
71
72
        .read("LINESTRING(1.0 2.0,3.0 1.0,4.0 0.0,3.0 -2.0,0.0 0.0,1.0 2.0)");
    LineString ls = (LineString) g2;

    // IntersectionMatrix rt = ComputeIm.getInstance().getIM(ls, pg);
    LineString_Polygon l2a = new LineString_Polygon(ls, pg);
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.match(IntersectionMatrix.DisjointPattern));

  }
View Full Code Here
81
82
83
84
85
86
87
88
89
        .read("LINESTRING(4.0 0.5,6.0 0.5,6.5 0.0,6.0 -1.0,4.0 0.0,4.0 0.5)");
    LineString ls = (LineString) g2;

    // IntersectionMatrix rt = ComputeIm.getInstance().getIM(ls, pg);
    LineString_Polygon l2a = new LineString_Polygon(ls, pg);
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.get(IntersectionMatrix.Inner, IntersectionMatrix.Inner) == IntersectionMatrix.EmptyDim);

  }
View Full Code Here
97
98
99
100
101
102
103
104
105
    LineString ls = (LineString) g;
    Polygon pg = (Polygon) g2;

    // IntersectionMatrix rt = ComputeIm.getInstance().getIM(ls, pg);
    LineString_Polygon l2a = new LineString_Polygon(ls, pg);
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.get(IntersectionMatrix.Inner, IntersectionMatrix.Inner) != IntersectionMatrix.EmptyDim);

  }
View Full Code Here
113
114
115
116
117
118
119
120
121
        .read("POLYGON((-2.639991350383829 -1.7999950537374092,-1.8399918576928131 -1.7999950537374092,-1.8399918576928131 -0.9999955610463935,-2.639991350383829 -0.9999955610463935,-2.639991350383829 -1.7999950537374092))");
    LineString ls = (LineString) g;
    Polygon pg = (Polygon) g2;

    LineString_LinearRing l2a = new LineString_LinearRing(ls, pg.getShell());
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.get(IntersectionMatrix.Inner, IntersectionMatrix.Inner) != IntersectionMatrix.EmptyDim);

  }
View Full Code Here
130
131
132
133
134
135
136
137
138
    LineString ls = (LineString) g;
    Polygon pg = (Polygon) g2;

    // IntersectionMatrix rt = ComputeIm.getInstance().getIM(ls, pg);
    LineString_LinearRing l2a = new LineString_LinearRing(ls, pg.getShell());
    IntersectionMatrix rt = l2a.getIM();
    assertTrue(rt.get(IntersectionMatrix.Inner, IntersectionMatrix.Inner) != IntersectionMatrix.EmptyDim);

  }
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
  protected void computeIM() {
    GeometryCollection c1 = (GeometryCollection) g1;
    GeometryCollection c2 = (GeometryCollection) g2;
    for (Geometry ge1 : c1) {
      for (Geometry ge2 : c2) {
        IntersectionMatrix tim = ComputeImFactory.getInstance()
            .getImComputer(ge1, ge2).getIM();
        im.unite(tim);
      }
    }
  }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
      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
29
30
31
32
33
34
35
36
37
    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
TOP

Related Classes of chunmap.model.relate.IntersectionMatrix

  • chunmap.model.operate.overlay.FragmentCollection
  • chunmap.model.relate.ComputeIm
  • chunmap.model.relate.relateop.LineString_LineStringTest
  • chunmap.model.relate.relateop.LineString_Polygon
  • chunmap.model.relate.relateop.LineString_PolygonTest
  • chunmap.model.relate.relateop.Multi2Multi
  • chunmap.model.relate.relateop.Point_LinearRingTest
  • chunmap.model.relate.relateop.Point_LineStringTest
  • chunmap.model.relate.relateop.Point_PointTest
  • chunmap.model.relate.relateop.Point_PolygonTest
    • 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.