Package org.osm2world.core.math

Examples of org.osm2world.core.math.VectorXYZ

683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
    }
   
    @Override
    public void renderTo(Target<?> target) {
     
      VectorXYZ startLeft = getEleConnectors().getPosXYZ(
          startPos.subtract(cutVector.mult(0.5 * startWidth)));
      VectorXYZ startRight = getEleConnectors().getPosXYZ(
          startPos.add(cutVector.mult(0.5 * startWidth)));
     
      VectorXYZ endLeft = getEleConnectors().getPosXYZ(
          endPos.subtract(cutVector.mult(0.5 * endWidth)));
      VectorXYZ endRight = getEleConnectors().getPosXYZ(
          endPos.add(cutVector.mult(0.5 * endWidth)));
     
      /* determine surface material */
     
      Material surface = getSurfaceForNode(node);
View Full Code Here
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
        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();
View Full Code Here
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
        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();
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
       
      for (int triangle = 0; triangle < vertices.size() / 3; triangle++) {
       
        int i = triangle * 3 + 1;
       
        VectorXYZ vBefore = vertices.get(i-1);
        VectorXYZ vAt = vertices.get(i);
        VectorXYZ vAfter = vertices.get(i+1);
       
        VectorXYZ toBefore = vBefore.subtract(vAt);
        VectorXYZ toAfter = vAfter.subtract(vAt);
       
        normals[i] = toBefore.crossNormalized(toAfter);
       
        normals[i-1] = normals[i];
        normals[i+1] = normals[i];
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
   
    for (int triangle = 0; triangle < vertices.size() - 2; triangle++) {
     
      int i = triangle + 1;
     
      VectorXYZ vBefore = vertices.get( fan ? 0 : (i-1) );
      VectorXYZ vAt = vertices.get(i);
      VectorXYZ vAfter = vertices.get(i+1);
     
      VectorXYZ toBefore = vBefore.subtract(vAt);
      VectorXYZ toAfter = vAfter.subtract(vAt);
     
      if (triangle % 2 == 0 || fan) {
        normals[i+1] = toBefore.crossNormalized(toAfter);
      } else {
        normals[i+1] = toAfter.crossNormalized(toBefore);
      }
     
    }
   
    normals[0] = normals[2];
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
185
186
    }
   
    /* calculate sum of relevant normals,
     * normalize it and set the result as normal for the vertex */

    VectorXYZ normal = new VectorXYZ(0, 0, 0);
    for (VectorXYZ addNormal : relevantNormals) {
      normal = normal.add(addNormal);
    }

    return normal.normalize();

  }
View Full Code Here
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
     
      if (relativePosition < 0 || relativePosition > 1) {
        System.out.println("PROBLEM");
      }
     
      VectorXYZ roadPoint = road.getPointOnCut(start, relativePosition);
     
      return roadPoint.add(0, getHeightAboveRoad(), 0);
     
    }
View Full Code Here
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
     
      if (relativePosition < 0 || relativePosition > 1) {
        System.out.println("PROBLEM");
      }
     
      VectorXYZ roadPoint = road.getPointOnCut(start, relativePosition);
     
      return roadPoint.add(0, getHeightAboveRoad(), 0);
     
    }
View Full Code Here
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
     
      double accumulatedLength = forward ? totalLength : 0;
     
      for (int i = 0; i < vs.size(); i++) {
       
        VectorXYZ v = vs.get(i);
       
        // increase accumulated length after every second vector
       
        if (i > 0 && i % 2 == 0) {
         
          double segmentLength = v.xz().distanceTo(vs.get(i-2).xz());
         
          if (forward) {
            accumulatedLength -= segmentLength;
          } else {
            accumulatedLength += segmentLength;
          }
         
        }
       
        // determine width of the lane at that point
       
        double width = (i % 2 == 0)
            ? v.distanceTo(vs.get(i+1))
            : v.distanceTo(vs.get(i-1));
       
        // determine whether this vertex should get the higher or
        // lower t coordinate from the vertex pair
       
        boolean higher = i % 2 == 0;
View Full Code Here
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
     
      double accumulatedLength = forward ? totalLength : 0;
     
      for (int i = 0; i < vs.size(); i++) {
       
        VectorXYZ v = vs.get(i);
       
        // increase accumulated length after every second vector
       
        if (i > 0 && i % 2 == 0) {
         
          double segmentLength = v.xz().distanceTo(vs.get(i-2).xz());
         
          if (forward) {
            accumulatedLength -= segmentLength;
          } else {
            accumulatedLength += segmentLength;
          }
         
        }
       
        // determine width of the lane at that point
       
        double width = (i % 2 == 0)
            ? v.distanceTo(vs.get(i+1))
            : v.distanceTo(vs.get(i-1));
       
        // determine whether this vertex should get the higher or
        // lower t coordinate from the vertex pair
       
        boolean higher = i % 2 == 0;
View Full Code Here
TOP

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

  • org.osm2world.console.Output
  • org.osm2world.core.map_elevation.creation.DelaunayTriangulation
  • org.osm2world.core.map_elevation.creation.LPEleConstraintEnforcer
  • org.osm2world.core.map_elevation.creation.NNDebugViewer$AddRandomPointAction
  • org.osm2world.core.map_elevation.creation.NNDebugViewer$NNDebugPanel
  • org.osm2world.core.map_elevation.data.EleConnectorGroup
  • org.osm2world.core.map_elevation.data.WaySegmentElevationProfile
  • org.osm2world.core.math.algorithms.NormalCalculationUtil
  • org.osm2world.core.math.algorithms.NormalCalculationUtilTest
  • org.osm2world.core.target.common.AbstractTarget
    • 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.