Package chunmap.model.algorithm

Examples of chunmap.model.algorithm.MonotonyChain

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
   * {@link chunmap.model.algorithm.MonotonyChain#intersection(chunmap.model.algorithm.MonotonyChain)}
   * 的测试方法。
   */
  @Test
  public void testIntersection() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0.5, 0.9);
    CPoint p4 = new Coordinate2D(1, 1);

    chain1.add(p1);
    chain1.add(p2);
    chain2.add(p3);
    chain2.add(p4);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 0);
  }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
    assertTrue(geos.size() == 0);
  }

  @Test
  public void testIntersection2() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0.5, 1);
    CPoint p4 = new Coordinate2D(1, 1);

    chain1.add(p1);
    chain1.add(p2);
    chain2.add(p3);
    chain2.add(p4);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection3() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0.5, 1);
    CPoint p5 = new Coordinate2D(2, 0);
    CPoint p6 = new Coordinate2D(2, 1);

    chain1.add(p1);
    chain1.add(p2);
    chain1.add(p5);

    chain2.add(p3);
    chain2.add(p6);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 2);
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
    assertTrue(geos.size() == 2);
  }

  @Test
  public void testIntersection4() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(1, 2);
    CPoint p2 = new Coordinate2D(1, 2);

    chain1.add(p1);
    chain2.add(p2);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection5() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0.5, 1);

    chain1.add(p1);
    chain1.add(p2);
    chain2.add(p3);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection6() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0, 0);
    CPoint p4 = new Coordinate2D(1, 2);

    chain1.add(p1);
    chain1.add(p2);
    chain2.add(p3);
    chain2.add(p4);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection7() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p3 = new Coordinate2D(0.5, 1);
    CPoint p4 = new Coordinate2D(2, 2);

    chain1.add(p1);
    chain1.add(p2);
    chain1.add(p4);

    chain2.add(p3);
    chain2.add(p2);
    chain2.add(p4);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection8() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 0);

    chain1.add(p1);
    chain1.add(p2);

    chain2.add(p1);
    chain2.add(p2);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection9() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(0, -1);

    chain1.add(p1);
    chain1.add(p2);

    chain2.add(p1);
    chain2.add(p2);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
    assertTrue(geos.size() == 1);
  }

  @Test
  public void testIntersection10() {
    MonotonyChain chain1 = new MonotonyChain();
    MonotonyChain chain2 = new MonotonyChain();

    CPoint p1 = new Coordinate2D(0, 0);
    CPoint p2 = new Coordinate2D(1, 2);
    CPoint p4 = new Coordinate2D(2, 2);
    CPoint p5 = new Coordinate2D(0.5, 2.8);
    CPoint p6 = new Coordinate2D(3, 3);
    CPoint p7 = new Coordinate2D(2, 1);

    chain1.add(p1);
    chain1.add(p2);
    chain1.add(p4);
    chain1.add(p6);

    chain2.add(p5);
    chain2.add(p2);
    chain2.add(p4);
    chain2.add(p7);

    PointLineBag geos = chain1.intersection(chain2);

    assertTrue(geos.size() == 1);
  }
View Full Code Here
TOP

Related Classes of chunmap.model.algorithm.MonotonyChain

  • chunmap.model.coord.CPoint
  • chunmap.model.elem.Envelope
  • chunmap.model.elem.LineSegment
  • chunmap.model.elem.MonotonyChainTest
  • chunmap.model.elem.PointLineBag
  • chunmap.model.geom.Geometry
  • chunmap.model.geom.GeoPoint
  • chunmap.model.geom.LineString
    • 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.