57 myEdgeCont(myTypeCont),
58 myNetworkHaveCrossings(false) {
81 const bool lefthand = oc.
getBool(
"lefthand");
95 if (mayAddOrRemove && oc.
exists(
"remove-edges.isolated") && oc.
getBool(
"remove-edges.isolated")) {
101 if (mayAddOrRemove && oc.
exists(
"keep-edges.components") && oc.
getInt(
"keep-edges.components") > 0) {
107 if (mayAddOrRemove && oc.
exists(
"keep-edges.postload") && oc.
getBool(
"keep-edges.postload")) {
108 if (oc.
isSet(
"keep-edges.explicit") || oc.
isSet(
"keep-edges.input-file")) {
116 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
119 if (!(oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output"))) {
126 if (oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output")) {
133 if (oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output") && oc.
exists(
"ptline-clean-up") && oc.
getBool(
"ptline-clean-up")) {
140 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
148 if (oc.
exists(
"railway.topology.all-bidi") && oc.
getBool(
"railway.topology.all-bidi")) {
151 }
else if (oc.
exists(
"railway.topology.repair") && oc.
getBool(
"railway.topology.repair")) {
155 if (oc.
exists(
"railway.topology.output") && oc.
isSet(
"railway.topology.output")) {
170 if (oc.
getBool(
"roundabouts.guess")) {
174 for (std::set<EdgeSet>::const_iterator it_round = roundabouts.begin();
175 it_round != roundabouts.end(); ++it_round) {
176 std::vector<std::string> nodeIDs;
177 for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) {
178 nodeIDs.push_back((*it_edge)->getToNode()->getID());
185 if (mayAddOrRemove && oc.
exists(
"junctions.join-exclude") && oc.
isSet(
"junctions.join-exclude")) {
189 if (mayAddOrRemove && oc.
getBool(
"junctions.join")) {
204 if (mayAddOrRemove && oc.
exists(
"join-lanes") && oc.
getBool(
"join-lanes")) {
212 if (mayAddOrRemove) {
214 const bool removeGeometryNodes = oc.
exists(
"geometry.remove") && oc.
getBool(
"geometry.remove");
216 PROGRESS_BEGIN_MESSAGE(
"Removing empty nodes" + std::string(removeGeometryNodes ?
" and geometry nodes" :
""));
228 boundary.
add(it->second->getPosition());
231 boundary.
add(it->second->getGeometry().getBoxBoundary());
240 if (oc.
exists(
"geometry.min-dist") && !oc.
isDefault(
"geometry.min-dist")) {
248 if (mayAddOrRemove && oc.
getBool(
"edges.join")) {
254 if (oc.
getBool(
"opposites.guess")) {
260 if (mayAddOrRemove && oc.
exists(
"geometry.split") && oc.
getBool(
"geometry.split")) {
272 if (oc.
exists(
"geometry.avoid-overlap") && oc.
getBool(
"geometry.avoid-overlap")) {
279 if (oc.
isSet(
"tls.set")) {
280 std::vector<std::string> tlControlledNodes = oc.
getStringVector(
"tls.set");
282 for (std::vector<std::string>::const_iterator i = tlControlledNodes.begin(); i != tlControlledNodes.end(); ++i) {
284 if (node ==
nullptr) {
285 WRITE_WARNING(
"Building a tl-logic for junction '" + *i +
"' is not possible." +
"\n The junction '" + *i +
"' is not known.");
295 if (mayAddOrRemove) {
296 const bool modifyRamps = (oc.
exists(
"ramps.guess") && oc.
getBool(
"ramps.guess"))
297 || (oc.
exists(
"ramps.set") && oc.
isSet(
"ramps.set"));
299 || (oc.
exists(
"ramps.guess-acceleration-lanes") && oc.
getBool(
"ramps.guess-acceleration-lanes"))) {
312 if (mayAddOrRemove && ((oc.
getBool(
"bikelanes.guess") || oc.
getBool(
"bikelanes.guess.from-permissions")))) {
314 oc.
getFloat(
"bikelanes.guess.min-speed"),
315 oc.
getFloat(
"bikelanes.guess.max-speed"),
316 oc.
getBool(
"bikelanes.guess.from-permissions"),
317 "bikelanes.guess.exclude");
322 if (mayAddOrRemove && ((oc.
getBool(
"sidewalks.guess") || oc.
getBool(
"sidewalks.guess.from-permissions")))) {
324 oc.
getFloat(
"sidewalks.guess.min-speed"),
325 oc.
getFloat(
"sidewalks.guess.max-speed"),
326 oc.
getBool(
"sidewalks.guess.from-permissions"),
327 "sidewalks.guess.exclude");
337 if (numChangedEdges + numChangedNodes > 0) {
342 if (oc.
exists(
"geometry.max-angle")) {
346 oc.
getBool(
"geometry.min-radius.fix"));
359 if (oc.
exists(
"geometry.junction-mismatch-threshold")) {
375 if (oc.
exists(
"speed.offset")) {
376 const double speedOffset = oc.
getFloat(
"speed.offset");
377 const double speedFactor = oc.
getFloat(
"speed.factor");
378 const double speedMin = oc.
getFloat(
"speed.minimum");
379 if (speedOffset != 0 || speedFactor != 1 || speedMin > 0) {
383 (*i).second->setSpeed(-1,
MAX2((*i).second->getSpeed() * speedFactor + speedOffset, speedMin));
397 if (mayAddOrRemove && oc.
getBool(
"crossings.guess")) {
401 crossings += (*i).second->guessCrossings();
408 if (i->second->getCrossingsIncludingInvalid().size() > 0) {
418 oc.
set(
"no-internal-links",
"false");
432 if (oc.
getBool(
"roundabouts.guess")) {
436 if (numGuessed > 0) {
456 if (!oc.
getBool(
"no-turnarounds")) {
461 if (oc.
exists(
"railway.topology.repair") && oc.
getBool(
"railway.topology.repair")
475 i->second->buildCrossingsAndWalkingAreas();
481 i->second->discardWalkingareas();
483 if (oc.
getBool(
"no-internal-links")) {
485 i->second->discardAllCrossings(
false);
513 std::string progCount =
"";
514 if (numbers.first != numbers.second) {
515 progCount =
"(" +
toString(numbers.second) +
" programs) ";
519 if (oc.
isSet(
"street-sign-output")) {
527 (*i).second->sortOutgoingConnectionsByIndex();
530 if (!oc.
getBool(
"no-internal-links")) {
535 (*i).second->buildInnerEdges();
540 if (oc.
getFloat(
"junctions.scurve-stretch") > 0) {
548 (*i).second->buildInnerEdges();
559 if (oc.
exists(
"geometry.check-overlap") && oc.
getFloat(
"geometry.check-overlap") > 0) {
574 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
578 double maxRadius = oc.
getFloat(
"railway.access-distance");
579 double accessFactor = oc.
getFloat(
"railway.access-factor");
580 int maxCount = oc.
getInt(
"railway.max-accesses");
583 if (numBidiStops > 0) {
584 if (oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output")) {
591 WRITE_MESSAGE(
"-----------------------------------------------------");
598 WRITE_MESSAGE(
"-----------------------------------------------------");
603 WRITE_WARNING(
"Network contains very large coordinates and will probably flicker in the GUI. Check for outlying nodes and make sure the network is shifted to the coordinate origin");
625 const double x = -boundary.
xmin();
626 const double y = -(lefthand ? boundary.
ymax() : boundary.
ymin());
631 (*i).second->reshiftPosition(x, y);
634 (*i).second->reshiftPosition(x, y);
637 (*i).second->reshiftPosition(x, y);
640 (*i).second->reshiftPosition(x, y);
651 (*i).second->mirrorX();
654 (*i).second->mirrorX();
657 (*i).second->mirrorX();
668 && from_srs !=
nullptr 681 double z = hm.
getZ(orig);
692 if (maxLength > 0 && from.size() > 1) {
695 for (
int i = 0; i < (int) from.size(); i++) {
701 for (
int i = 0; i < (int)copy.size() - 1; i++) {
702 Position start = from[i + inserted];
703 Position end = from[i + inserted + 1];
704 double length = copy[i].distanceTo(copy[i + 1]);
705 const Position step = (end - start) * (maxLength / length);
707 while (length > maxLength) {
710 from.insert(from.begin() + i + inserted + 1, start + (step * steps));
718 for (
int i = 0; i < (int) from.size(); i++) {
NBNetBuilder()
Constructor.
NBTypeCont myTypeCont
The used container for street types.
NBNode * retrieve(const std::string &id) const
Returns the node with the given name.
void joinSimilarEdges(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc)
Joins edges connecting the same nodes.
NBPTStopCont myPTStopCont
The used container for pt stops.
double ymin() const
Returns minimum y-coordinate.
void removeSelfLoops(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tc)
Removes self-loop edges (edges where the source and the destination node are the same) ...
double xmax() const
Returns maximum x-coordinate.
void sortOutgoingLanesConnections()
Sorts all lanes of all edges within the container by their direction.
void markRoundabouts()
mark edge priorities and prohibit turn-arounds for all roundabout edges
void setConvBoundary(const Boundary &boundary)
sets the converted boundary
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
static void validateRailCrossings(NBNodeCont &nc, NBTrafficLightLogicCont &tlc)
Checks rail_crossing for validity.
void resetWritable()
Resets all options to be writeable.
int generateBidiStops(NBEdgeCont &cont)
duplicate stops for superposed rail edges and return the number of generated stops ...
void computeLogics2(const NBEdgeCont &ec, OptionsCont &oc)
compute right-of-way logic for all lane-to-lane connections
static bool transformCoordinate(Position &from, bool includeInBoundary=true, GeoConvHelper *from_srs=0)
transforms loaded coordinates handles projections, offsets (using GeoConvHelper) and import of height...
std::map< std::string, NBNode * >::const_iterator begin() const
Returns the pointer to the begin of the stored nodes.
void reduceGeometries(const double minDist)
void addJoinExclusion(const std::vector< std::string > &ids, bool check=false)
int removeUnwishedNodes(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc, NBPTStopCont &sc, NBPTLineCont &lc, NBParkingCont &pc, bool removeGeometryNodes)
Removes "unwished" nodes.
const Boundary & getConvBoundary() const
Returns the converted boundary.
std::map< std::string, NBNode * >::const_iterator end() const
Returns the pointer to the end of the stored nodes.
void mirrorX()
mirror the network along the X-axis
void removeIsolatedRoads(NBDistrictCont &dc, NBEdgeCont &ec)
Removes sequences of edges that are not connected with a junction. Simple roads without junctions som...
void joinTLS(NBTrafficLightLogicCont &tlc, double maxdist)
Builds clusters of tls-controlled junctions and joins the control if possible.
int guessRoundabouts()
Determines which edges belong to roundabouts and increases their priority.
static void repairTopology(NBNetBuilder &nb)
static void computeFinal(bool lefthand=false)
compute the location attributes which will be used for output based on the loaded location data...
~NBNetBuilder()
Destructor.
void postprocess(std::set< std::string > &usedStops)
static GeoConvHelper & getProcessing()
the coordinate transformation to use for input conversion and processing
bool x2cartesian(Position &from, bool includeInBoundary=true)
Converts the given coordinate into a cartesian and optionally update myConvBoundary.
double y() const
Returns the y-position.
std::map< std::string, NBDistrict * >::const_iterator end() const
Returns the pointer to the end of the stored districts.
bool usingGeoProjection() const
Returns whether a transformation from geo to metric coordinates will be performed.
void guessOpposites()
Sets opposite lane information for geometrically close edges.
double x() const
Returns the x-position.
static GeoConvHelper & getLoaded()
the coordinate transformation that was loaded fron an input file
void findAccessEdgesForRailStops(NBEdgeCont &cont, double maxRadius, int maxCount, double accessFactor)
int joinLoadedClusters(NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc)
Joins loaded junction clusters (see NIXMLNodesHandler)
const Boundary & getOrigBoundary() const
Returns the original boundary.
void generateStreetSigns()
assigns street signs to edges based on toNode types
void recheckPostProcessConnections()
Try to set any stored connections.
static bool transformCoordinates(PositionVector &from, bool includeInBoundary=true, GeoConvHelper *from_srs=0)
void guessTLs(OptionsCont &oc, NBTrafficLightLogicCont &tlc)
Guesses which junctions or junction clusters shall be controlled by tls.
std::map< std::string, NBEdge * >::const_iterator end() const
Returns the pointer to the end of the stored edges.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
void avoidOverlap()
fix overlap
std::map< std::string, NBDistrict * >::const_iterator begin() const
Returns the pointer to the begin of the stored districts.
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
static void sortNodesEdges(NBNodeCont &nc, bool useNodeShape=false)
Sorts a node's edges clockwise regarding driving direction.
void computeLanes2Edges()
Computes for each edge which lanes approach the next edges.
void moveConvertedBy(double x, double y)
Shifts the converted boundary by the given amounts.
A class that stores a 2D geometrical boundary.
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
void checkGeometries(const double maxAngle, const double minRadius, bool fix)
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
void fixBidiStops(const NBEdgeCont &ec)
select the correct stop on superposed rail edges
void checkOverlap(double threshold, double zThreshold) const
check whether edges overlap
int joinLanes(SVCPermissions perms)
join adjacent lanes with the given permissions
void computeLogics(const NBEdgeCont &ec, OptionsCont &oc)
build the list of outgoing edges and lanes
void localizePTStops(NBEdgeCont &cont)
void checkGrade(double threshold) const
check whether edges are to steep
static const NBHeightMapper & get()
return the singleton instance (maybe 0)
void cartesian2geo(Position &cartesian) const
Converts the given cartesian (shifted) position to its geo (lat/long) representation.
void process(NBEdgeCont &cont)
int guessSpecialLanes(SUMOVehicleClass svc, double width, double minSpeed, double maxSpeed, bool fromPermissions, const std::string &excludeOpt)
add sidwalks to edges within the given limits or permissions and return the number of edges affected ...
static void reportWarnings()
reports warnings if any occurred
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
#define PROGRESS_TIME_MESSAGE(before)
static void analyzeTopology(NBNetBuilder &nb)
Computes highway on-/off-ramps (if wished)
std::set< std::string > & getServedPTStops()
int joinJunctions(double maxDist, NBDistrictCont &dc, NBEdgeCont &ec, NBTrafficLightLogicCont &tlc, NBPTStopCont &sc)
Joins junctions that are very close together.
void assignLanes(NBEdgeCont &cont)
std::map< std::string, NBPTStop * >::const_iterator begin() const
Returns the pointer to the begin of the stored pt stops.
std::map< std::string, NBEdge * >::const_iterator begin() const
Returns the pointer to the begin of the stored edges.
static methods for processing the coordinates conversion for the current net
void computeLanes2Lanes()
divides the incoming lanes on outgoing lanes
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
void removeUnwishedEdges(NBDistrictCont &dc)
Removes unwished edges (not in keep-edges)
static StringBijection< TrafficLightType > TrafficLightTypes
traffic light types
A point in 2D or 3D with translation and scaling methods.
void setDefaults(int defaultNumLanes, double defaultLaneWidth, double defaultSpeed, int defaultPriority, SVCPermissions defaultPermissions)
Sets the default values.
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
static void computeEdgePriorities(NBNodeCont &nc)
Computes edge priorities within a node.
void applyOptions(OptionsCont &oc)
Initialises the storage by applying given options.
NBEdgeCont myEdgeCont
The used container for edges.
T get(const std::string &str) const
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
bool myNetworkHaveCrossings
flag to indicate that network has crossings
void computeEdge2Edges(bool noLeftMovers)
Computes for each edge the approached edges.
void computeLaneShapes()
Computes the shapes of all lanes of all edges stored in the container.
NBTrafficLightLogicCont myTLLCont
The used container for traffic light logics.
bool exists(const std::string &name) const
Returns the information whether the named option is known.
std::vector< std::string > getStringVector(const std::string &name) const
Returns the list of string-vector-value of the named option (only for Option_String) ...
double xmin() const
Returns minimum x-coordinate.
void computeNodeShapes(double mismatchThreshold=-1)
Compute the junction shape for this node.
#define PROGRESS_BEGIN_MESSAGE(msg)
void splitGeometry(NBNodeCont &nc)
Splits edges into multiple if they have a complex geometry.
static void makeAllBidi(NBNetBuilder &nb)
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
std::map< std::string, NBPTStop * >::const_iterator end() const
Returns the pointer to the end of the stored pt stops.
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
int remapIDs(bool numericaIDs, bool reservedIDs, const std::string &prefix)
remap node IDs accoring to options –numerical-ids and –reserved-ids
const std::map< std::string, NBPTStop * > & getStops() const
void setAsTLControlled(NBNode *node, NBTrafficLightLogicCont &tlc, TrafficLightType type, std::string id="")
Sets the given node as being controlled by a tls.
static void computeRamps(NBNetBuilder &nb, OptionsCont &oc)
Computes highway on-/off-ramps (if wished)
bool set(const std::string &name, const std::string &value)
Sets the given value for the named option.
void moveToOrigin(GeoConvHelper &geoConvHelper, bool lefthand)
shift network so its lower left corner is at 0,0
static int getNumLoaded()
static bool runningNetedit()
whether netbuilding takes place in the context of NETEDIT
A storage for options typed value containers)
const Position getOffsetBase() const
Returns the network base.
void appendRailwayTurnarounds(const NBPTStopCont &sc)
Appends turnarounds to all bidiRail edges with stops.
Represents a single node (junction) during network building.
static void computeTurnDirections(NBNodeCont &nc, bool warn=true)
Computes turnaround destinations for all edges (if exist)
NBDistrictCont myDistrictCont
The used container for districts.
void computeEdgeShapes(double smoothElevationThreshold=-1)
Computes the shapes of all edges stored in the container.
void printBuiltNodesStatistics() const
Prints statistics about built nodes.
double getZ(const Position &geo) const
returns height for the given geo coordinate (WGS84)
void compute(OptionsCont &oc, const std::set< std::string > &explicitTurnarounds=std::set< std::string >(), bool mayAddOrRemove=true)
Performs the network building steps.
void recheckLanes()
Rechecks whether all lanes have a successor for each of the stored edges.
static void computeNodeTypes(NBNodeCont &nc, NBTrafficLightLogicCont &tlc)
Computes node types.
static long getCurrentMillis()
Returns the current time in milliseconds.
#define PROGRESS_DONE_MESSAGE()
void add(double x, double y, double z=0)
Makes the boundary include the given coordinate.
NBParkingCont myParkingCont
double ymax() const
Returns maximum y-coordinate.
#define WRITE_MESSAGE(msg)
double getZRange() const
Returns the elevation range of the boundary (z-axis)
NBNodeCont myNodeCont
The used container for nodes.
void setTLControllingInformation(const NBEdgeCont &ec, const NBNodeCont &nc)
Informs the edges about being controlled by a tls.
int remapIDs(bool numericaIDs, bool reservedIDs, const std::string &prefix, NBPTStopCont &sc)
remap node IDs accoring to options –numerical-ids and –reserved-ids
std::pair< int, int > computeLogics(OptionsCont &oc)
Computes the traffic light logics using the stored definitions and stores the results.
bool ready() const
returns whether the NBHeightMapper has data
Set z-values for all network positions based on data from a height map.
vehicles ignoring classes
void appendTurnarounds(bool noTLSControlled, bool onlyDeadends, bool noGeometryLike)
Appends turnarounds to all edges stored in the container.
NBPTLineCont myPTLineCont
The used container for pt stops.
void removeComponents(NBDistrictCont &dc, NBEdgeCont &ec, const int numKeep)
Checks the network for weak connectivity and removes all but the largest components. The connectivity check is done regardless of edge direction and vclass.