Package org.osm2world.core.math

Examples of org.osm2world.core.math.VectorXZ

66
67
68
69
70
71
72
73
74
75
76
    filteredPoints.removeAll(knownVectors);
   
    // remove points that are *almost* the same as a known vector
    Iterator<VectorXZ> filteredPointsIterator = filteredPoints.iterator();
    while (filteredPointsIterator.hasNext()) {
      VectorXZ filteredPoint = filteredPointsIterator.next();
      for (VectorXZ knownVector : knownVectors) {
        if (knownVector.distanceTo(filteredPoint) < 0.2) {
          filteredPointsIterator.remove();
        }
      }
View Full Code Here
137
138
139
140
141
142
143
  private static final TPoint toTPoint(VectorXZ v) {
    return new TPoint(v.x, v.z);
  }

  private static final VectorXZ toVectorXZ(TriangulationPoint points) {
    return new VectorXZ(points.getX(), points.getY());
  }
View Full Code Here
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
      return laneLayout;
    }
   
    private void renderStepsTo(Target<?> target) {
     
      final VectorXZ startWithOffset = getStartPosition();
      final VectorXZ endWithOffset = getEndPosition();
   
      List<VectorXYZ> leftOutline = getOutline(false);
      List<VectorXYZ> rightOutline = getOutline(true);
     
     
      double lineLength = VectorXZ.distance (
          segment.getStartNode().getPos(), segment.getEndNode().getPos());
     
      /* render ground first (so gaps between the steps look better) */
     
      List<VectorXYZ> vs = createTriangleStripBetween(
          leftOutline, rightOutline);

      target.drawTriangleStrip(ASPHALT, vs,
          texCoordLists(vs, ASPHALT, GLOBAL_X_Z));
     
      /* determine the length of each individual step */
     
      float stepLength = 0.3f;
     
      if (tags.containsKey("step_count")) {
        try {
          int stepCount = Integer.parseInt(tags.getValue("step_count"));
          stepLength = (float)lineLength / stepCount;
        } catch (NumberFormatException e) { /* don't overwrite default length */ }
      }
     
      /* locate the position on the line at the beginning/end of each step
       * (positions on the line spaced by step length),
       * interpolate heights between adjacent points with elevation */
     
      List<VectorXYZ> centerline = getCenterline();
     
      List<VectorXZ> stepBorderPositionsXZ =
        GeometryUtil.equallyDistributePointsAlong(
          stepLength, true, startWithOffset, endWithOffset);
     
      List<VectorXYZ> stepBorderPositions = new ArrayList<VectorXYZ>();
      for (VectorXZ posXZ : stepBorderPositionsXZ) {
        VectorXYZ posXYZ = interpolateElevation(posXZ,
            centerline.get(0),
            centerline.get(centerline.size() - 1));
        stepBorderPositions.add(posXYZ);
      }
     
      /* draw steps */
     
      for (int step = 0; step < stepBorderPositions.size() - 1; step++) {
       
        VectorXYZ frontCenter = stepBorderPositions.get(step);
        VectorXYZ backCenter = stepBorderPositions.get(step+1);
       
        double height = abs(frontCenter.y - backCenter.y);
               
        VectorXYZ center = (frontCenter.add(backCenter)).mult(0.5);
        center = center.subtract(Y_UNIT.mult(0.5 * height));
       
        VectorXZ faceDirection = segment.getDirection();
        if (frontCenter.y < backCenter.y) {
          //invert if upwards
          faceDirection = faceDirection.invert();
        }
       
        target.drawBox(Materials.STEPS_DEFAULT,
            center, faceDirection,
            height, width, backCenter.distanceToXZ(frontCenter));
View Full Code Here
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
          t = higher ? 0 - padding : 1 + padding;
        } else {
          t = higher ? 0 : 1;
        }
       
        result.add(new VectorXZ(s, t));
       
      }
     
      return result;
     
View Full Code Here
382
383
384
385
386
387
388
389
390
391
392
393
    tempVertices.add(outline.get(0));
    SimplePolygonXZ tempPolygon = new SimplePolygonXZ(tempVertices);

    //TODO (performance) avoid creating polygon by passing clockwise information
   
    VectorXZ segBefore = outline.get(i).subtract(vertexBefore(outline, i));
    VectorXZ segAfter = vertexAfter(outline, i).subtract(outline.get(i));
   
    return tempPolygon.isClockwise() ^
      segBefore.z * segAfter.x - segBefore.x * segAfter.z < 0;
   
  }
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
143
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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
   
    { /* calculate centerline */
           
      centerlineXZ = new ArrayList<VectorXZ>();
     
      final VectorXZ start = getStartWithOffset();
      final VectorXZ end = getEndWithOffset();
     
      centerlineXZ.add(start);
     
      connectors.add(new EleConnector(start,
          segment.getStartNode(), getGroundState(segment.getStartNode())));
     
      // add intersections along the centerline
     
      for (MapOverlap<?,?> overlap : segment.getOverlaps()) {
       
        if (overlap.getOther(segment).getPrimaryRepresentation() == null)
          continue;
       
        if (overlap instanceof MapIntersectionWW) {
         
          MapIntersectionWW intersection = (MapIntersectionWW) overlap;
         
          if (GeometryUtil.isBetween(intersection.pos, start, end)) {
           
            centerlineXZ.add(intersection.pos);
           
            connectors.add(new EleConnector(intersection.pos,
                null, getGroundState()));
           
          }
         
        } else if (overlap instanceof MapOverlapWA
            && overlap.type == MapOverlapType.INTERSECT) {
         
          if (!(overlap.getOther(segment).getPrimaryRepresentation()
              instanceof AbstractAreaWorldObject)) continue;
         
          MapOverlapWA overlapWA = (MapOverlapWA) overlap;
         
          for (int i = 0; i < overlapWA.getIntersectionPositions().size(); i++) {
         
            VectorXZ pos = overlapWA.getIntersectionPositions().get(i);
           
            if (GeometryUtil.isBetween(pos, start, end)) {
             
              centerlineXZ.add(pos);
             
              connectors.add(new EleConnector(pos,
                  null, getGroundState()));
             
            }
         
          }
         
        }
       
       
      }
     
      // finish the centerline
     
      centerlineXZ.add(end);

      connectors.add(new EleConnector(end,
          segment.getEndNode(), getGroundState(segment.getEndNode())));
     
      if (centerlineXZ.size() > 3) {
       
        // sort by distance from start
        Collections.sort(centerlineXZ, new Comparator<VectorXZ>() {
          @Override
          public int compare(VectorXZ v1, VectorXZ v2) {
            return Double.compare(
                distanceSquared(v1, start),
                distanceSquared(v2, start));
          }
        });
       
      }
     
    }
   
    { /* calculate left and right outlines */
     
      leftOutlineXZ = new ArrayList<VectorXZ>(centerlineXZ.size());
      rightOutlineXZ = new ArrayList<VectorXZ>(centerlineXZ.size());
     
      assert centerlineXZ.size() >= 2;
     
      double halfWidth = getWidth() * 0.5f;
     
      VectorXZ centerStart = centerlineXZ.get(0);
      leftOutlineXZ.add(centerStart.add(startCutVector.mult(-halfWidth)));
      rightOutlineXZ.add(centerStart.add(startCutVector.mult(halfWidth)));
     
      connectors.add(new EleConnector(leftOutlineXZ.get(0),
          segment.getStartNode(), getGroundState(segment.getStartNode())));
      connectors.add(new EleConnector(rightOutlineXZ.get(0),
          segment.getStartNode(), getGroundState(segment.getStartNode())));
     
      for (int i = 1; i < centerlineXZ.size() - 1; i++) {
       
        leftOutlineXZ.add(centerlineXZ.get(i).add(segment.getRightNormal().mult(-halfWidth)));
        rightOutlineXZ.add(centerlineXZ.get(i).add(segment.getRightNormal().mult(halfWidth)));
       
        connectors.add(new EleConnector(leftOutlineXZ.get(i),
            null, getGroundState()));
        connectors.add(new EleConnector(rightOutlineXZ.get(i),
            null, getGroundState()));
       
      }
     
      VectorXZ centerEnd = centerlineXZ.get(centerlineXZ.size() - 1);
      leftOutlineXZ.add(centerEnd.add(endCutVector.mult(-halfWidth)));
      rightOutlineXZ.add(centerEnd.add(endCutVector.mult(halfWidth)));
     
      connectors.add(new EleConnector(leftOutlineXZ.get(leftOutlineXZ.size() - 1),
          segment.getEndNode(), getGroundState(segment.getEndNode())));
      connectors.add(new EleConnector(rightOutlineXZ.get(rightOutlineXZ.size() - 1),
          segment.getEndNode(), getGroundState(segment.getEndNode())));
View Full Code Here
598
599
600
601
602
603
604
605
606
607
608
609
   */
  public VectorXYZ getPointOnCut(boolean start, double relativePosFromLeft) {
   
    assert 0 <= relativePosFromLeft && relativePosFromLeft <= 1;
   
    VectorXZ position = start ? getStartWithOffset() : getEndWithOffset();
    VectorXZ cutVector = start ? getStartCutVector() : getEndCutVector();
   
    return connectors.getPosXYZ(position.add(cutVector.mult(
        (-0.5 + relativePosFromLeft) * getWidth())));
   
  }
 
View Full Code Here
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
 
  @Test
  public void testOverlap() {
   
    List<VectorXZ> outline = asList(
        new VectorXZ( 1,-2),
        new VectorXZ( 1, 2),
        new VectorXZ(-1, 2),
        new VectorXZ(-1,-2),
        new VectorXZ( 1,-2)
    );
   
    List<VectorXZ> subOutline = asList(
        new VectorXZ( 2,-1),
        new VectorXZ( 0,-1),
        new VectorXZ( 0, 1),
        new VectorXZ( 2, 1),
        new VectorXZ( 2,-1)
    );
   
    List<PolygonWithHolesXZ> results = new ArrayList<PolygonWithHolesXZ>(
        CAGUtil.subtractPolygons(
            new SimplePolygonXZ(outline),
            Arrays.asList(new SimplePolygonXZ(subOutline))));
   
    assertSame(1, results.size());
   
    assertSameCyclicOrder(results.get(0).getOuter().getVertices(),
        new VectorXZ( 1,-2),
        new VectorXZ( 1,-1),
        new VectorXZ( 0,-1),
        new VectorXZ( 0, 1),
        new VectorXZ( 1, 1),
        new VectorXZ( 1, 2),
        new VectorXZ(-1, 2),
        new VectorXZ(-1,-2));
   
  }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
 
  @Test
  public void testOverlapCommonNode() {
   
    List<VectorXZ> outline = asList(
        new VectorXZ( 1,-2),
        new VectorXZ( 1, 2),
        new VectorXZ(-1, 2),
        new VectorXZ(-1,-2),
        new VectorXZ( 1,-2)
    );
   
    List<VectorXZ> subOutline1 = asList(
        new VectorXZ( 2,-1),
        new VectorXZ( 0,-1),
        new VectorXZ( 0, 0),
        new VectorXZ( 2, 0),
        new VectorXZ( 2,-1)
    );
   
    List<VectorXZ> subOutline2 = asList(
        new VectorXZ( 2, 0),
        new VectorXZ( 0, 0),
        new VectorXZ( 0, 1),
        new VectorXZ( 2, 1),
        new VectorXZ( 2, 0)
    );
   
    List<PolygonWithHolesXZ> results = new ArrayList<PolygonWithHolesXZ>(
        CAGUtil.subtractPolygons(
            new SimplePolygonXZ(outline),
            Arrays.asList(
                new SimplePolygonXZ(subOutline1),
                new SimplePolygonXZ(subOutline2))));
   
    assertSame(1, results.size());
   
    List<VectorXZ> res = results.get(0).getOuter().getVertices();
   
    assertSameCyclicOrder(res,
        new VectorXZ( 1,-2),
        new VectorXZ( 1,-1),
        new VectorXZ( 0,-1),
        new VectorXZ( 0, 0),
        new VectorXZ( 0, 1),
        new VectorXZ( 1, 1),
        new VectorXZ( 1, 2),
        new VectorXZ(-1, 2),
        new VectorXZ(-1,-2));
   
  }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
 
  @Test
  public void testOverlapConvex() {
   
    List<VectorXZ> outline = asList(
        new VectorXZ( 1,-2),
        new VectorXZ( 1, 2),
        new VectorXZ(-1,-1),
        new VectorXZ(-1,-2),
        new VectorXZ( 1,-2)
    );
   
    List<VectorXZ> subOutline = asList(
        new VectorXZ( 0,-3),
        new VectorXZ(-2,-3),
        new VectorXZ(-2, 0),
        new VectorXZ( 0, 0),
        new VectorXZ( 0,-3)
    );
   
    List<PolygonWithHolesXZ> results = new ArrayList<PolygonWithHolesXZ>(
        CAGUtil.subtractPolygons(
            new SimplePolygonXZ(outline),
            Arrays.asList(new SimplePolygonXZ(subOutline))));
   
    assertSame(1, results.size());
   
    List<VectorXZ> res = results.get(0).getOuter().getVertices();
   
    assertSameCyclicOrder(res,
        new VectorXZ( 1,-2),
        new VectorXZ( 1, 2),
        new VectorXZ(-1/3.0, 0),
        new VectorXZ( 0, 0),
        new VectorXZ( 0,-2));
   
  }
View Full Code Here
TOP

Related Classes of org.osm2world.core.math.VectorXZ

  • org.osm2world.core.heightmap.data.AbstractCellularTerrainElevation
  • org.osm2world.core.map_data.creation.EmptyTerrainBuilder
  • org.osm2world.core.map_data.creation.index.Map2dTree$InnerNode
  • org.osm2world.core.map_data.creation.index.MapQuadtree$QuadNode
  • org.osm2world.core.map_data.creation.MetricMapProjection
  • org.osm2world.core.map_data.creation.MultipolygonAreaBuilder
  • org.osm2world.core.map_data.creation.OrthographicAzimuthalMapProjection
  • org.osm2world.core.map_data.creation.OrthographicAzimuthalMapProjectionTest
  • org.osm2world.core.map_data.creation.OSMToMapDataConverter
  • org.osm2world.core.map_data.creation.OSMToMapDataConverterTest
    • 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.