View Javadoc
1   package org.opentrafficsim.road.network.lane;
2   
3   import static org.junit.Assert.assertEquals;
4   import static org.junit.Assert.assertFalse;
5   import static org.junit.Assert.assertNotNull;
6   import static org.junit.Assert.assertTrue;
7   import static org.opentrafficsim.core.gtu.GTUType.CAR;
8   
9   import java.awt.geom.Point2D;
10  import java.util.LinkedHashMap;
11  import java.util.Map;
12  
13  import javax.media.j3d.BoundingBox;
14  import javax.media.j3d.Bounds;
15  import javax.vecmath.Point3d;
16  
17  import org.djunits.unit.UNITS;
18  import org.djunits.value.vdouble.scalar.Length;
19  import org.djunits.value.vdouble.scalar.Speed;
20  import org.junit.Test;
21  import org.opentrafficsim.core.compatibility.GTUCompatibility;
22  import org.opentrafficsim.core.geometry.OTSLine3D;
23  import org.opentrafficsim.core.geometry.OTSPoint3D;
24  import org.opentrafficsim.core.gtu.GTUType;
25  import org.opentrafficsim.core.network.LinkType;
26  import org.opentrafficsim.core.network.LongitudinalDirectionality;
27  import org.opentrafficsim.core.network.Network;
28  import org.opentrafficsim.core.network.Node;
29  import org.opentrafficsim.core.network.OTSNetwork;
30  import org.opentrafficsim.core.network.OTSNode;
31  import org.opentrafficsim.road.mock.MockDEVSSimulator;
32  import org.opentrafficsim.road.network.lane.changing.LaneKeepingPolicy;
33  import org.opentrafficsim.road.network.lane.changing.OvertakingConditions;
34  
35  import com.vividsolutions.jts.geom.Coordinate;
36  import com.vividsolutions.jts.geom.Geometry;
37  import com.vividsolutions.jts.geom.GeometryFactory;
38  
39  import nl.tudelft.simulation.dsol.simulators.DEVSSimulatorInterface;
40  import nl.tudelft.simulation.language.d3.DirectedPoint;
41  
42  /**
43   * Test the Lane class.
44   * <p>
45   * Copyright (c) 2013-2018 Delft University of Technology, PO Box 5, 2600 AA, Delft, the Netherlands. All rights reserved. <br>
46   * BSD-style license. See <a href="http://opentrafficsim.org/docs/license.html">OpenTrafficSim License</a>.
47   * <p>
48   * $LastChangedDate: 2015-09-16 19:20:07 +0200 (Wed, 16 Sep 2015) $, @version $Revision: 1405 $, by $Author: averbraeck $,
49   * initial version 21 jan. 2015 <br>
50   * @author <a href="http://www.tudelft.nl/pknoppers">Peter Knoppers</a>
51   */
52  public class LaneTest implements UNITS
53  {
54      /**
55       * Test the constructor.
56       * @throws Exception when something goes wrong (should not happen)
57       */
58      @Test
59      public void laneConstructorTest() throws Exception
60      {
61          // First we need two Nodes
62          Network network = new OTSNetwork("lane test network");
63          OTSNode nodeFrom = new OTSNode(network, "A", new OTSPoint3D(0, 0, 0));
64          OTSNode nodeTo = new OTSNode(network, "B", new OTSPoint3D(1000, 0, 0));
65          // Now we can make a Link
66          OTSPoint3D[] coordinates = new OTSPoint3D[2];
67          coordinates[0] = new OTSPoint3D(nodeFrom.getPoint().x, nodeFrom.getPoint().y, 0);
68          coordinates[1] = new OTSPoint3D(nodeTo.getPoint().x, nodeTo.getPoint().y, 0);
69          DEVSSimulatorInterface.TimeDoubleUnit simulator = MockDEVSSimulator.createMock();
70          CrossSectionLink link = new CrossSectionLink(network, "A to B", nodeFrom, nodeTo, LinkType.ROAD,
71                  new OTSLine3D(coordinates), simulator, LaneKeepingPolicy.KEEP_RIGHT);
72          Length startLateralPos = new Length(2, METER);
73          Length endLateralPos = new Length(5, METER);
74          Length startWidth = new Length(3, METER);
75          Length endWidth = new Length(4, METER);
76          GTUType gtuTypeCar = CAR;
77  
78          GTUCompatibility<LaneType> gtuCompatibility = new GTUCompatibility<>((LaneType) null);
79          gtuCompatibility.addAllowedGTUType(GTUType.VEHICLE, LongitudinalDirectionality.DIR_PLUS);
80          LaneType laneType = new LaneType("One way", LaneType.FREEWAY, gtuCompatibility);
81          Map<GTUType, Speed> speedMap = new LinkedHashMap<>();
82          speedMap.put(GTUType.VEHICLE, new Speed(100, KM_PER_HOUR));
83          // Now we can construct a Lane
84          // FIXME what overtaking conditions do we want to test in this unit test?
85          Lane lane = new Lane(link, "lane", startLateralPos, endLateralPos, startWidth, endWidth, laneType, speedMap,
86                  new OvertakingConditions.LeftAndRight());
87          // Verify the easy bits
88          assertEquals("PrevLanes should be empty", 0, lane.prevLanes(gtuTypeCar).size()); // this one caught a bug!
89          assertEquals("NextLanes should be empty", 0, lane.nextLanes(gtuTypeCar).size());
90          double approximateLengthOfContour =
91                  2 * nodeFrom.getPoint().distanceSI(nodeTo.getPoint()) + startWidth.getSI() + endWidth.getSI();
92          assertEquals("Length of contour is approximately " + approximateLengthOfContour, approximateLengthOfContour,
93                  lane.getContour().getLengthSI(), 0.1);
94          assertEquals("Directionality should be " + LongitudinalDirectionality.DIR_PLUS, LongitudinalDirectionality.DIR_PLUS,
95                  lane.getLaneType().getDirectionality(GTUType.VEHICLE));
96          assertEquals("SpeedLimit should be " + (new Speed(100, KM_PER_HOUR)), new Speed(100, KM_PER_HOUR),
97                  lane.getSpeedLimit(GTUType.VEHICLE));
98          assertEquals("There should be no GTUs on the lane", 0, lane.getGtuList().size());
99          assertEquals("LaneType should be " + laneType, laneType, lane.getLaneType());
100         // TODO: This test for expectedLateralCenterOffset fails
101         /*-
102         for (int i = 0; i < 10; i++)
103         {
104             double expectedLateralCenterOffset =
105                     startLateralPos.getSI() + (endLateralPos.getSI() - startLateralPos.getSI()) * i / 10;
106             assertEquals(String.format("Lateral offset at %d%% should be %.3fm", 10 * i, expectedLateralCenterOffset),
107                     expectedLateralCenterOffset, lane.getLateralCenterPosition(i / 10.0).getSI(), 0.01);
108             Length longitudinalPosition = new Length(lane.getLength().getSI() * i / 10, METER);
109             assertEquals("Lateral offset at " + longitudinalPosition + " should be " + expectedLateralCenterOffset,
110                     expectedLateralCenterOffset, lane.getLateralCenterPosition(longitudinalPosition).getSI(), 0.01);
111             double expectedWidth = startWidth.getSI() + (endWidth.getSI() - startWidth.getSI()) * i / 10;
112             assertEquals(String.format("Width at %d%% should be %.3fm", 10 * i, expectedWidth), expectedWidth,
113                     lane.getWidth(i / 10.0).getSI(), 0.0001);
114             assertEquals("Width at " + longitudinalPosition + " should be " + expectedWidth, expectedWidth,
115                     lane.getWidth(longitudinalPosition).getSI(), 0.0001);
116             double expectedLeftOffset = expectedLateralCenterOffset - expectedWidth / 2;
117             // The next test caught a bug
118             assertEquals(String.format("Left edge at %d%% should be %.3fm", 10 * i, expectedLeftOffset), expectedLeftOffset,
119                     lane.getLateralBoundaryPosition(LateralDirectionality.LEFT, i / 10.0).getSI(), 0.001);
120             assertEquals("Left edge at " + longitudinalPosition + " should be " + expectedLeftOffset, expectedLeftOffset,
121                     lane.getLateralBoundaryPosition(LateralDirectionality.LEFT, longitudinalPosition).getSI(), 0.001);
122             double expectedRightOffset = expectedLateralCenterOffset + expectedWidth / 2;
123             assertEquals(String.format("Right edge at %d%% should be %.3fm", 10 * i, expectedRightOffset), expectedRightOffset,
124                     lane.getLateralBoundaryPosition(LateralDirectionality.RIGHT, i / 10.0).getSI(), 0.001);
125             assertEquals("Right edge at " + longitudinalPosition + " should be " + expectedRightOffset, expectedRightOffset,
126                     lane.getLateralBoundaryPosition(LateralDirectionality.RIGHT, longitudinalPosition).getSI(), 0.001);
127         }
128         */
129 
130         // Harder case; create a Link with form points along the way
131         // System.out.println("Constructing Link and Lane with one form point");
132         coordinates = new OTSPoint3D[3];
133         coordinates[0] = new OTSPoint3D(nodeFrom.getPoint().x, nodeFrom.getPoint().y, 0);
134         coordinates[1] = new OTSPoint3D(200, 100);
135         coordinates[2] = new OTSPoint3D(nodeTo.getPoint().x, nodeTo.getPoint().y, 0);
136         link = new CrossSectionLink(network, "A to B with Kink", nodeFrom, nodeTo, LinkType.ROAD, new OTSLine3D(coordinates),
137                 simulator, LaneKeepingPolicy.KEEP_RIGHT);
138         // FIXME what overtaking conditions do we ant to test in this unit test?
139         lane = new Lane(link, "lane.1", startLateralPos, endLateralPos, startWidth, endWidth, laneType, speedMap,
140                 new OvertakingConditions.LeftAndRight());
141         // Verify the easy bits
142         assertEquals("PrevLanes should be empty", 0, lane.prevLanes(gtuTypeCar).size());
143         assertEquals("NextLanes should be empty", 0, lane.nextLanes(gtuTypeCar).size());
144         approximateLengthOfContour = 2 * (coordinates[0].distanceSI(coordinates[1]) + coordinates[1].distanceSI(coordinates[2]))
145                 + startWidth.getSI() + endWidth.getSI();
146         assertEquals("Length of contour is approximately " + approximateLengthOfContour, approximateLengthOfContour,
147                 lane.getContour().getLengthSI(), 4); // This lane takes a path that is about 3m longer
148         assertEquals("There should be no GTUs on the lane", 0, lane.getGtuList().size());
149         assertEquals("LaneType should be " + laneType, laneType, lane.getLaneType());
150         // System.out.println("Add another Lane at the inside of the corner in the design line");
151         Length startLateralPos2 = new Length(-8, METER);
152         Length endLateralPos2 = new Length(-5, METER);
153         // FIXME what overtaking conditions do we ant to test in this unit test?
154         Lane lane2 = new Lane(link, "lane.2", startLateralPos2, endLateralPos2, startWidth, endWidth, laneType, speedMap,
155                 new OvertakingConditions.LeftAndRight());
156         // Verify the easy bits
157         assertEquals("PrevLanes should be empty", 0, lane2.prevLanes(gtuTypeCar).size());
158         assertEquals("NextLanes should be empty", 0, lane2.nextLanes(gtuTypeCar).size());
159         approximateLengthOfContour = 2 * (coordinates[0].distanceSI(coordinates[1]) + coordinates[1].distanceSI(coordinates[2]))
160                 + startWidth.getSI() + endWidth.getSI();
161         assertEquals("Length of contour is approximately " + approximateLengthOfContour, approximateLengthOfContour,
162                 lane2.getContour().getLengthSI(), 12); // This lane takes a path that is about 11 meters shorter
163         assertEquals("There should be no GTUs on the lane", 0, lane2.getGtuList().size());
164         assertEquals("LaneType should be " + laneType, laneType, lane2.getLaneType());
165     }
166 
167     /**
168      * Test that the contour of a constructed lane covers the expected area. Tests are only performed for straight lanes, but
169      * the orientation of the link and the offset of the lane from the link is varied in many ways.
170      * @throws Exception when something goes wrong (should not happen)
171      */
172     @Test
173     public final void contourTest() throws Exception
174     {
175         final int[] startPositions = { 0, 1, -1, 20, -20 };
176         final double[] angles = { 0, Math.PI * 0.01, Math.PI / 3, Math.PI / 2, Math.PI * 2 / 3, Math.PI * 0.99, Math.PI,
177                 Math.PI * 1.01, Math.PI * 4 / 3, Math.PI * 3 / 2, Math.PI * 1.99, Math.PI * 2, Math.PI * (-0.2) };
178         LaneType laneType = LaneType.TWO_WAY_LANE;
179         Map<GTUType, LongitudinalDirectionality> directionalityMap = new LinkedHashMap<>();
180         directionalityMap.put(GTUType.VEHICLE, LongitudinalDirectionality.DIR_PLUS);
181         Map<GTUType, Speed> speedMap = new LinkedHashMap<>();
182         speedMap.put(GTUType.VEHICLE, new Speed(50, KM_PER_HOUR));
183         int laneNum = 0;
184         for (int xStart : startPositions)
185         {
186             for (int yStart : startPositions)
187             {
188                 for (double angle : angles)
189                 {
190                     Network network = new OTSNetwork("contour test network");
191                     OTSNode start = new OTSNode(network, "start", new OTSPoint3D(xStart, yStart));
192                     double linkLength = 1000;
193                     double xEnd = xStart + linkLength * Math.cos(angle);
194                     double yEnd = yStart + linkLength * Math.sin(angle);
195                     OTSNode end = new OTSNode(network, "end", new OTSPoint3D(xEnd, yEnd));
196                     OTSPoint3D[] coordinates = new OTSPoint3D[2];
197                     coordinates[0] = start.getPoint();
198                     coordinates[1] = end.getPoint();
199                     OTSLine3D line = new OTSLine3D(coordinates);
200                     DEVSSimulatorInterface.TimeDoubleUnit simulator = MockDEVSSimulator.createMock();
201                     CrossSectionLink link = new CrossSectionLink(network, "A to B", start, end, LinkType.ROAD, line, simulator,
202                             LaneKeepingPolicy.KEEP_RIGHT);
203                     final int[] lateralOffsets = { -10, -3, -1, 0, 1, 3, 10 };
204                     for (int startLateralOffset : lateralOffsets)
205                     {
206                         for (int endLateralOffset : lateralOffsets)
207                         {
208                             int startWidth = 4; // This one is not varied
209                             for (int endWidth : new int[] { 2, 4, 6 })
210                             {
211                                 // Now we can construct a Lane
212                                 // FIXME what overtaking conditions do we want to test in this unit test?
213                                 Lane lane = new Lane(link, "lane." + ++laneNum, new Length(startLateralOffset, METER),
214                                         new Length(endLateralOffset, METER), new Length(startWidth, METER),
215                                         new Length(endWidth, METER), laneType, speedMap,
216                                         new OvertakingConditions.LeftAndRight());
217                                 final Geometry geometry = lane.getContour().getLineString();
218                                 assertNotNull("geometry of the lane should not be null", geometry);
219                                 // Verify a couple of points that should be inside the contour of the Lane
220                                 // One meter along the lane design line
221                                 checkInside(lane, 1, startLateralOffset, true);
222                                 // One meter before the end along the lane design line
223                                 checkInside(lane, link.getLength().getSI() - 1, endLateralOffset, true);
224                                 // One meter before the start of the lane along the lane design line
225                                 checkInside(lane, -1, startLateralOffset, false);
226                                 // One meter beyond the end of the lane along the lane design line
227                                 checkInside(lane, link.getLength().getSI() + 1, endLateralOffset, false);
228                                 // One meter along the lane design line, left outside the lane
229                                 checkInside(lane, 1, startLateralOffset - startWidth / 2 - 1, false);
230                                 // One meter along the lane design line, right outside the lane
231                                 checkInside(lane, 1, startLateralOffset + startWidth / 2 + 1, false);
232                                 // One meter before the end, left outside the lane
233                                 checkInside(lane, link.getLength().getSI() - 1, endLateralOffset - endWidth / 2 - 1, false);
234                                 // One meter before the end, right outside the lane
235                                 checkInside(lane, link.getLength().getSI() - 1, endLateralOffset + endWidth / 2 + 1, false);
236                                 // Check the result of getBounds.
237                                 DirectedPoint l = lane.getLocation();
238                                 Bounds bb = lane.getBounds();
239                                 // System.out.println("bb is " + bb);
240                                 // System.out.println("l is " + l.x + "," + l.y + "," + l.z);
241                                 // System.out.println("start is at " + start.getX() + ", " + start.getY());
242                                 // System.out.println(" end is at " + end.getX() + ", " + end.getY());
243                                 Point2D.Double[] cornerPoints = new Point2D.Double[4];
244                                 cornerPoints[0] =
245                                         new Point2D.Double(xStart - (startLateralOffset + startWidth / 2) * Math.sin(angle),
246                                                 yStart + (startLateralOffset + startWidth / 2) * Math.cos(angle));
247                                 cornerPoints[1] =
248                                         new Point2D.Double(xStart - (startLateralOffset - startWidth / 2) * Math.sin(angle),
249                                                 yStart + (startLateralOffset - startWidth / 2) * Math.cos(angle));
250                                 cornerPoints[2] = new Point2D.Double(xEnd - (endLateralOffset + endWidth / 2) * Math.sin(angle),
251                                         yEnd + (endLateralOffset + endWidth / 2) * Math.cos(angle));
252                                 cornerPoints[3] = new Point2D.Double(xEnd - (endLateralOffset - endWidth / 2) * Math.sin(angle),
253                                         yEnd + (endLateralOffset - endWidth / 2) * Math.cos(angle));
254                                 // for (int i = 0; i < cornerPoints.length; i++)
255                                 // {
256                                 // System.out.println("p" + i + ": " + cornerPoints[i].x + "," + cornerPoints[i].y);
257                                 // }
258                                 double minX = cornerPoints[0].getX();
259                                 double maxX = cornerPoints[0].getX();
260                                 double minY = cornerPoints[0].getY();
261                                 double maxY = cornerPoints[0].getY();
262                                 for (int i = 1; i < cornerPoints.length; i++)
263                                 {
264                                     Point2D.Double p = cornerPoints[i];
265                                     minX = Math.min(minX, p.getX());
266                                     minY = Math.min(minY, p.getY());
267                                     maxX = Math.max(maxX, p.getX());
268                                     maxY = Math.max(maxY, p.getY());
269                                 }
270                                 Point3d bbLow = new Point3d();
271                                 ((BoundingBox) bb).getLower(bbLow);
272                                 Point3d bbHigh = new Point3d();
273                                 ((BoundingBox) bb).getUpper(bbHigh);
274                                 // System.out.println(" my bbox is " + minX + "," + minY + " - " + maxX + "," + maxY);
275                                 // System.out.println("the bbox is " + (bbLow.x + l.x) + "," + (bbLow.y + l.y) + " - "
276                                 // + (bbHigh.x + l.x) + "," + (bbHigh.y + l.y));
277                                 double boundsMinX = bbLow.x + l.x;
278                                 double boundsMinY = bbLow.y + l.y;
279                                 double boundsMaxX = bbHigh.x + l.x;
280                                 double boundsMaxY = bbHigh.y + l.y;
281                                 assertEquals("low x boundary", minX, boundsMinX, 0.1);
282                                 assertEquals("low y boundary", minY, boundsMinY, 0.1);
283                                 assertEquals("high x boundary", maxX, boundsMaxX, 0.1);
284                                 assertEquals("high y boundary", maxY, boundsMaxY, 0.1);
285                             }
286                         }
287                     }
288                 }
289             }
290         }
291     }
292 
293     /**
294      * Verify that a point at specified distance along and across from the design line of the parent Link of a Lane is inside
295      * c.q. outside the contour of a Lane. The test uses an implementation that is as independent as possible of the Geometry
296      * class methods.
297      * @param lane Lane; the lane
298      * @param longitudinal double; the longitudinal position along the design line of the parent Link of the Lane. This design
299      *            line is expected to be straight and the longitudinal position may be negative (indicating a point before the
300      *            start of the Link) and it may exceed the length of the Link (indicating a point beyond the end of the Link)
301      * @param lateral double; the lateral offset from the design line of the link (positive is left, negative is right)
302      * @param expectedResult boolean; true if the calling method expects the point to be within the contour of the Lane, false
303      *            if the calling method expects the point to be outside the contour of the Lane
304      */
305     private void checkInside(final Lane lane, final double longitudinal, final double lateral, final boolean expectedResult)
306     {
307         CrossSectionLink parentLink = lane.getParentLink();
308         Node start = parentLink.getStartNode();
309         Node end = parentLink.getEndNode();
310         double startX = start.getPoint().x;
311         double startY = start.getPoint().y;
312         double endX = end.getPoint().x;
313         double endY = end.getPoint().y;
314         double length = Math.sqrt((endX - startX) * (endX - startX) + (endY - startY) * (endY - startY));
315         double ratio = longitudinal / length;
316         double designLineX = startX + (endX - startX) * ratio;
317         double designLineY = startY + (endY - startY) * ratio;
318         double lateralAngle = Math.atan2(endY - startY, endX - startX) + Math.PI / 2;
319         double px = designLineX + lateral * Math.cos(lateralAngle);
320         double py = designLineY + lateral * Math.sin(lateralAngle);
321         Geometry contour = lane.getContour().getLineString();
322         GeometryFactory factory = new GeometryFactory();
323         Geometry p = factory.createPoint(new Coordinate(px, py));
324         // CrossSectionElement.printCoordinates("contour: ", contour);
325         // System.out.println("p: " + p);
326         boolean result = contour.contains(p);
327         Coordinate[] polygon = contour.getCoordinates();
328         result = pointInsidePolygon(new Coordinate(px, py), polygon);
329         if (expectedResult)
330         {
331             assertTrue("Point at " + longitudinal + " along and " + lateral + " lateral is within lane", result);
332         }
333         else
334         {
335             assertFalse("Point at " + longitudinal + " along and " + lateral + " lateral is outside lane", result);
336         }
337     }
338 
339     /**
340      * Algorithm of W. Randolph Franklin http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html, found via
341      * stackoverflow.com: http://stackoverflow.com/questions/217578/point-in-polygon-aka-hit-test.
342      * @param point Coordinate; the point
343      * @param polygon OTSPoint3D[]; the polygon (last coordinate is allowed to be identical to the first, but his is not a
344      *            requirement)
345      * @return boolean; true if the point is inside the polygon; false if it is outside the polygon; if the point lies <b>on</b>
346      *         an vertex or edge of the polygon the result is (of course) undefined
347      */
348     private boolean pointInsidePolygon(final Coordinate point, final Coordinate[] polygon)
349     {
350         boolean result = false;
351         for (int i = 0, j = polygon.length - 1; i < polygon.length; j = i++)
352         {
353             if ((polygon[i].y > point.y) != (polygon[j].y > point.y)
354                     && point.x < (polygon[j].x - polygon[i].x) * (point.y - polygon[i].y) / (polygon[j].y - polygon[i].y)
355                             + polygon[i].x)
356             {
357                 result = !result;
358             }
359         }
360         return result;
361     }
362 
363 }