SUMO - Simulation of Urban MObility
NBContHelper.cpp
Go to the documentation of this file.
1 /****************************************************************************/
9 // Some methods for traversing lists of edges
10 /****************************************************************************/
11 // SUMO, Simulation of Urban MObility; see http://sumo.dlr.de/
12 // Copyright (C) 2001-2016 DLR (http://www.dlr.de/) and contributors
13 /****************************************************************************/
14 //
15 // This file is part of SUMO.
16 // SUMO is free software: you can redistribute it and/or modify
17 // it under the terms of the GNU General Public License as published by
18 // the Free Software Foundation, either version 3 of the License, or
19 // (at your option) any later version.
20 //
21 /****************************************************************************/
22 
23 
24 // ===========================================================================
25 // included modules
26 // ===========================================================================
27 #ifdef _MSC_VER
28 #include <windows_config.h>
29 #else
30 #include <config.h>
31 #endif
32 
33 #include <vector>
34 #include <map>
35 #include <cassert>
36 #include "NBContHelper.h"
37 #include <utils/geom/GeomHelper.h>
38 
39 #ifdef CHECK_MEMORY_LEAKS
40 #include <foreign/nvwa/debug_new.h>
41 #endif // CHECK_MEMORY_LEAKS
42 
43 
44 // ===========================================================================
45 // method definitions
46 // ===========================================================================
47 /* -------------------------------------------------------------------------
48  * utility methods
49  * ----------------------------------------------------------------------- */
50 void
51 NBContHelper::nextCW(const EdgeVector& edges, EdgeVector::const_iterator& from) {
52  from++;
53  if (from == edges.end()) {
54  from = edges.begin();
55  }
56 }
57 
58 
59 void
60 NBContHelper::nextCCW(const EdgeVector& edges, EdgeVector::const_iterator& from) {
61  if (from == edges.begin()) {
62  from = edges.end() - 1;
63  } else {
64  --from;
65  }
66 }
67 
68 
69 std::ostream&
70 NBContHelper::out(std::ostream& os, const std::vector<bool>& v) {
71  for (std::vector<bool>::const_iterator i = v.begin(); i != v.end(); i++) {
72  os << *i;
73  }
74  return os;
75 }
76 
77 
78 NBEdge*
80  NBNode* from, NBNode* to) {
81  for (EdgeVector::const_iterator i = edges.begin(); i != edges.end(); i++) {
82  if ((*i)->getToNode() == to && (*i)->getFromNode() == from) {
83  return *i;
84  }
85  }
86  return 0;
87 }
88 
89 
90 
93  assert(ev.size() > 0);
94  SUMOReal max = (*(ev.begin()))->getSpeed();
95  for (EdgeVector::const_iterator i = ev.begin() + 1; i != ev.end(); i++) {
96  max =
97  max > (*i)->getSpeed()
98  ? max : (*i)->getSpeed();
99  }
100  return max;
101 }
102 
103 
104 
105 /* -------------------------------------------------------------------------
106  * methods from node_with_incoming_finder
107  * ----------------------------------------------------------------------- */
109  : myEdge(e) {}
110 
111 
112 bool
114  const EdgeVector& incoming = n->getIncomingEdges();
115  return std::find(incoming.begin(), incoming.end(), myEdge) != incoming.end();
116 }
117 
118 
119 
120 /* -------------------------------------------------------------------------
121  * methods from node_with_outgoing_finder
122  * ----------------------------------------------------------------------- */
124  : myEdge(e) {}
125 
126 
127 bool
129  const EdgeVector& outgoing = n->getOutgoingEdges();
130  return std::find(outgoing.begin(), outgoing.end(), myEdge) != outgoing.end();
131 }
132 
133 
134 
135 /* -------------------------------------------------------------------------
136  * methods from edge_with_destination_finder
137  * ----------------------------------------------------------------------- */
139  : myDestinationNode(dest) {}
140 
141 
142 bool
144  return e->getToNode() == myDestinationNode;
145 }
146 
147 /* -------------------------------------------------------------------------
148  * methods from relative_outgoing_edge_sorter
149  * ----------------------------------------------------------------------- */
150 int
152  if (e1 == 0 || e2 == 0) {
153  return -1;
154  }
155  SUMOReal relAngle1 = NBHelpers::normRelAngle(
156  myEdge->getEndAngle(), e1->getStartAngle());
157  SUMOReal relAngle2 = NBHelpers::normRelAngle(
158  myEdge->getEndAngle(), e2->getStartAngle());
159 
160  SUMOReal lookAhead = 2 * NBEdge::ANGLE_LOOKAHEAD;
161  while (fabs(relAngle1 - relAngle2) < 3.0) {
162  // look at further geometry segments to resolve ambiguity
163  const Position referencePos1 = e1->getGeometry().positionAtOffset2D(lookAhead);
164  const Position referencePos2 = e2->getGeometry().positionAtOffset2D(lookAhead);
165  relAngle1 = NBHelpers::normRelAngle(myEdge->getEndAngle(), GeomHelper::legacyDegree(
166  e1->getFromNode()->getPosition().angleTo2D(referencePos1), true));
167  relAngle2 = NBHelpers::normRelAngle(myEdge->getEndAngle(), GeomHelper::legacyDegree(
168  e2->getFromNode()->getPosition().angleTo2D(referencePos2), true));
169  if (lookAhead > MAX2(e1->getLength(), e2->getLength())) {
170  break;
171  }
172  lookAhead *= 2;
173  }
174  return relAngle1 > relAngle2;
175 }
176 
177 
178 /* -------------------------------------------------------------------------
179  * methods from straightness_sorter
180  * ----------------------------------------------------------------------- */
181 int
183  if (e1 == 0 || e2 == 0) {
184  return -1;
185  }
186  SUMOReal relAngle1 = NBHelpers::normRelAngle(
187  myReferenceAngle, e1->getShapeStartAngle());
188  SUMOReal relAngle2 = NBHelpers::normRelAngle(
189  myReferenceAngle, e2->getShapeStartAngle());
190 
191  //std::cout << " e1=" << e1->getID() << " e2=" << e2->getID() << " initially a1=" << relAngle1 << " a2=" << relAngle2 << "\n";
192  SUMOReal lookAhead = 2 * NBEdge::ANGLE_LOOKAHEAD;
193  while (fabs(relAngle1 - relAngle2) < 3.0) {
194  // look at further geometry segments to resolve ambiguity
195  const Position referencePos1 = e1->getGeometry().positionAtOffset2D(lookAhead);
196  const Position referencePos2 = e2->getGeometry().positionAtOffset2D(lookAhead);
197  relAngle1 = NBHelpers::normRelAngle(myReferenceAngle, GeomHelper::legacyDegree(
198  e1->getGeometry().front().angleTo2D(referencePos1), true));
199  relAngle2 = NBHelpers::normRelAngle(myReferenceAngle, GeomHelper::legacyDegree(
200  e2->getGeometry().front().angleTo2D(referencePos2), true));
201  if (lookAhead > MAX2(e1->getLength(), e2->getLength())) {
202  break;
203  }
204  lookAhead *= 2;
205  }
206  if (fabs(relAngle1 - relAngle2) < 3.0) {
207  // use angle to end of reference edge as tiebraker
208  relAngle1 = NBHelpers::normRelAngle(myReferenceAngle, GeomHelper::legacyDegree(
209  myReferencePos.angleTo2D(e1->getLaneShape(0).front()), true));
210  relAngle2 = NBHelpers::normRelAngle(myReferenceAngle, GeomHelper::legacyDegree(
211  myReferencePos.angleTo2D(e2->getLaneShape(0).front()), true));
212  //std::cout << " tiebraker refPos=" << myReferencePos << " abs1="
213  // << GeomHelper::legacyDegree(myReferencePos.angleTo2D(e1->getLaneShape(0).front()), true)
214  // << " abs2=" << GeomHelper::legacyDegree(myReferencePos.angleTo2D(e2->getLaneShape(0).front()), true) << "\n";
215  }
216  //std::cout << " e1=" << e1->getID() << " e2=" << e2->getID() << " a1=" << relAngle1 << " a2=" << relAngle2 << "\n";
217  return fabs(relAngle1) < fabs(relAngle2);
218 }
219 
220 
221 /* -------------------------------------------------------------------------
222  * methods from relative_incoming_edge_sorter
223  * ----------------------------------------------------------------------- */
224 int
226  if (e1 == 0 || e2 == 0) {
227  return -1;
228  }
229  SUMOReal relAngle1 = NBHelpers::normRelAngle(
230  myEdge->getStartAngle(), e1->getEndAngle());
231  SUMOReal relAngle2 = NBHelpers::normRelAngle(
232  myEdge->getStartAngle(), e2->getEndAngle());
233 
234  SUMOReal lookAhead = 2 * NBEdge::ANGLE_LOOKAHEAD;
235  while (fabs(relAngle1 - relAngle2) < 3.0) {
236  // look at further geometry segments to resolve ambiguity
237  const Position referencePos1 = e1->getGeometry().positionAtOffset2D(e1->getGeometry().length() - lookAhead);
238  const Position referencePos2 = e2->getGeometry().positionAtOffset2D(e2->getGeometry().length() - lookAhead);
239  relAngle1 = NBHelpers::normRelAngle(myEdge->getStartAngle(), GeomHelper::legacyDegree(
240  referencePos1.angleTo2D(e1->getToNode()->getPosition()), true));
241  relAngle2 = NBHelpers::normRelAngle(myEdge->getStartAngle(), GeomHelper::legacyDegree(
242  referencePos2.angleTo2D(e2->getToNode()->getPosition()), true));
243  if (lookAhead > MAX2(e1->getLength(), e2->getLength())) {
244  break;
245  }
246  lookAhead *= 2;
247  }
248  return relAngle1 > relAngle2;
249 }
250 
251 
252 std::ostream&
253 operator<<(std::ostream& os, const EdgeVector& ev) {
254  for (EdgeVector::const_iterator i = ev.begin(); i != ev.end(); i++) {
255  if (i != ev.begin()) {
256  os << ", ";
257  }
258  os << (*i)->getID();
259  }
260  return os;
261 }
262 
263 
264 
265 
266 SUMOReal
268  if (edges.size() == 0) {
269  return -1;
270  }
271  SUMOReal ret = (*(edges.begin()))->getSpeed();
272  for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
273  if ((*i)->getSpeed() > ret) {
274  ret = (*i)->getSpeed();
275  }
276  }
277  return ret;
278 }
279 
280 
281 SUMOReal
283  if (edges.size() == 0) {
284  return -1;
285  }
286  SUMOReal ret = (*(edges.begin()))->getSpeed();
287  for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
288  if ((*i)->getSpeed() < ret) {
289  ret = (*i)->getSpeed();
290  }
291  }
292  return ret;
293 }
294 
295 
296 int
298  assert(e1->getFromNode() == myNode || e1->getToNode() == myNode);
299  assert(e2->getFromNode() == myNode || e2->getToNode() == myNode);
300  const SUMOReal angle1 = e1->getAngleAtNodeToCenter(myNode);
301  const SUMOReal angle2 = e2->getAngleAtNodeToCenter(myNode);
302  const SUMOReal absDiff = fabs(angle1 - angle2);
303 
304  // cannot trust the angle difference hence a heuristic:
305  if (absDiff < 2 || absDiff > (360 - 2)) {
306  const bool sameDir = ((e1->getFromNode() == myNode && e2->getFromNode() == myNode)
307  || (e1->getToNode() == myNode && e2->getToNode() == myNode));
308  if (sameDir) {
309  // put edges that allow pedestrians on the 'outside', but be aware if both allow / disallow
310  const bool e1Peds = (e1->getPermissions() & SVC_PEDESTRIAN) != 0;
311  const bool e2Peds = (e2->getPermissions() & SVC_PEDESTRIAN) != 0;
312  if (e1->getToNode() == myNode) {
313  if (e1Peds && !e2Peds) {
314  return true;
315  } else if (!e1Peds && e2Peds) {
316  return false;
317  }
318  } else {
319  if (!e1Peds && e2Peds) {
320  return true;
321  } else if (e1Peds && !e2Peds) {
322  return false;
323  }
324  }
325  // break ties to ensure strictly weak ordering
326  return e1->getID() < e2->getID();
327  } else {
328  // sort incoming before outgoing, no need to break ties here
329  return e1->getToNode() == myNode;
330  }
331  }
332  return angle1 < angle2;
333 }
334 
335 /****************************************************************************/
336 
const EdgeVector & getIncomingEdges() const
Returns this node&#39;s incoming edges.
Definition: NBNode.h:240
node_with_outgoing_finder(const NBEdge *const e)
constructor
is a pedestrian
static SUMOReal normRelAngle(SUMOReal angle1, SUMOReal angle2)
ensure that reverse relAngles (>=179.999) always count as turnarounds (-180)
Definition: NBHelpers.cpp:69
SUMOReal getEndAngle() const
Returns the angle at the end of the edge (relative to the node shape center) The angle is computed in...
Definition: NBEdge.h:391
friend std::ostream & operator<<(std::ostream &os, const EdgeVector &ev)
The representation of a single edge during network building.
Definition: NBEdge.h:70
T MAX2(T a, T b)
Definition: StdDefs.h:75
bool operator()(const NBNode *const n) const
SUMOReal getShapeStartAngle() const
Returns the angle at the start of the edge (only using edge shape)
Definition: NBEdge.cpp:1428
static void nextCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
int operator()(const NBEdge *e1, const NBEdge *e2) const
comparing operation
Position positionAtOffset2D(SUMOReal pos, SUMOReal lateralOffset=0) const
Returns the position at the given length.
int operator()(NBEdge *e1, NBEdge *e2) const
comparing operation
const EdgeVector & getOutgoingEdges() const
Returns this node&#39;s outgoing edges.
Definition: NBNode.h:248
const std::string & getID() const
Returns the id.
Definition: Named.h:66
const Position & getPosition() const
Returns the position of this node.
Definition: NBNode.h:228
#define max(a, b)
Definition: polyfonts.c:65
static std::ostream & out(std::ostream &os, const std::vector< bool > &v)
static SUMOReal legacyDegree(const SUMOReal angle, const bool positive=false)
Definition: GeomHelper.cpp:204
bool operator()(const NBNode *const n) const
A point in 2D or 3D with translation and scaling methods.
Definition: Position.h:46
static SUMOReal maxSpeed(const EdgeVector &ev)
SUMOReal getAngleAtNodeToCenter(const NBNode *const node) const
Returns the angle of from the node shape center to where the edge meets the node shape.
Definition: NBEdge.cpp:1312
edge_with_destination_finder(NBNode *dest)
constructor
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
Definition: NBEdge.cpp:2575
static SUMOReal getMaxSpeed(const EdgeVector &edges)
SUMOReal length() const
Returns the length.
NBNode * getToNode() const
Returns the destination node of the edge.
Definition: NBEdge.h:371
std::vector< NBEdge * > EdgeVector
Definition: NBCont.h:41
const PositionVector & getGeometry() const
Returns the geometry of the edge.
Definition: NBEdge.h:546
int operator()(NBEdge *e1, NBEdge *e2) const
comparing operation
node_with_incoming_finder(const NBEdge *const e)
constructor
Represents a single node (junction) during network building.
Definition: NBNode.h:74
#define SUMOReal
Definition: config.h:213
SUMOReal getStartAngle() const
Returns the angle at the start of the edge (relative to the node shape center) The angle is computed ...
Definition: NBEdge.h:381
static SUMOReal getMinSpeed(const EdgeVector &edges)
const PositionVector & getLaneShape(int i) const
Returns the shape of the nth lane.
Definition: NBEdge.cpp:554
static void nextCCW(const EdgeVector &edges, EdgeVector::const_iterator &from)
int operator()(NBEdge *e1, NBEdge *e2) const
comparing operation
SUMOReal angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position ...
Definition: Position.h:243
static const SUMOReal ANGLE_LOOKAHEAD
the distance at which to take the default angle
Definition: NBEdge.h:216
static NBEdge * findConnectingEdge(const EdgeVector &edges, NBNode *from, NBNode *to)
SUMOReal getLength() const
Returns the computed length of the edge.
Definition: NBEdge.h:424
NBNode * getFromNode() const
Returns the origin node of the edge.
Definition: NBEdge.h:363