62 myEdgeCont(myTypeCont),
63 myHaveLoadedNetworkWithoutInternalEdges(false),
64 myNetworkHaveCrossings(false) {
87 const bool lefthand = oc.
getBool(
"lefthand");
101 if (mayAddOrRemove && oc.
exists(
"remove-edges.isolated") && oc.
getBool(
"remove-edges.isolated")) {
107 if (mayAddOrRemove && oc.
exists(
"keep-edges.components") && oc.
getInt(
"keep-edges.components") > 0) {
113 if (mayAddOrRemove && oc.
exists(
"keep-edges.postload") && oc.
getBool(
"keep-edges.postload")) {
114 if (oc.
isSet(
"keep-edges.explicit") || oc.
isSet(
"keep-edges.input-file")) {
122 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
125 if (!(oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output"))) {
132 if (oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output")) {
139 if (oc.
exists(
"ptline-output") && oc.
isSet(
"ptline-output") && oc.
exists(
"ptline-clean-up") && oc.
getBool(
"ptline-clean-up")) {
146 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
163 if (oc.
getBool(
"roundabouts.guess")) {
167 for (std::set<EdgeSet>::const_iterator it_round = roundabouts.begin();
168 it_round != roundabouts.end(); ++it_round) {
169 std::vector<std::string> nodeIDs;
170 for (EdgeSet::const_iterator it_edge = it_round->begin(); it_edge != it_round->end(); ++it_edge) {
171 nodeIDs.push_back((*it_edge)->getToNode()->getID());
177 if (mayAddOrRemove && oc.
exists(
"junctions.join-exclude") && oc.
isSet(
"junctions.join-exclude")) {
181 if (mayAddOrRemove && oc.
getBool(
"junctions.join")) {
196 if (mayAddOrRemove) {
198 const bool removeGeometryNodes = oc.
exists(
"geometry.remove") && oc.
getBool(
"geometry.remove");
200 PROGRESS_BEGIN_MESSAGE(
"Removing empty nodes" + std::string(removeGeometryNodes ?
" and geometry nodes" :
""));
212 boundary.
add(it->second->getPosition());
215 boundary.
add(it->second->getGeometry().getBoxBoundary());
224 if (oc.
exists(
"geometry.min-dist") && !oc.
isDefault(
"geometry.min-dist")) {
232 if (mayAddOrRemove && oc.
getBool(
"edges.join")) {
238 if (oc.
getBool(
"opposites.guess")) {
244 if (mayAddOrRemove && oc.
exists(
"geometry.split") && oc.
getBool(
"geometry.split")) {
258 if (mayAddOrRemove) {
268 if (mayAddOrRemove && ((oc.
getBool(
"sidewalks.guess") || oc.
getBool(
"sidewalks.guess.from-permissions")))) {
270 oc.
getFloat(
"sidewalks.guess.min-speed"),
271 oc.
getFloat(
"sidewalks.guess.max-speed"),
272 oc.
getBool(
"sidewalks.guess.from-permissions"));
282 if (numChangedEdges + numChangedNodes > 0) {
287 if (oc.
exists(
"geometry.max-angle")) {
291 oc.
getBool(
"geometry.min-radius.fix"));
304 if (oc.
exists(
"geometry.junction-mismatch-threshold")) {
320 if (oc.
exists(
"speed.offset")) {
321 const double speedOffset = oc.
getFloat(
"speed.offset");
322 const double speedFactor = oc.
getFloat(
"speed.factor");
323 if (speedOffset != 0 || speedFactor != 1) {
324 const double speedMin = oc.
getFloat(
"speed.minimum");
328 (*i).second->setSpeed(-1,
MAX2((*i).second->getSpeed() * speedFactor + speedOffset, speedMin));
342 if (mayAddOrRemove && oc.
getBool(
"crossings.guess")) {
346 crossings += (*i).second->guessCrossings();
353 if (i->second->getCrossingsIncludingInvalid().size() > 0) {
361 oc.
set(
"no-internal-links",
"true");
365 oc.
set(
"no-internal-links",
"false");
379 if (mayAddOrRemove && oc.
getBool(
"roundabouts.guess")) {
383 if (numGuessed > 0) {
403 if (!oc.
getBool(
"no-turnarounds")) {
417 i->second->buildCrossingsAndWalkingAreas();
419 }
else if (oc.
getBool(
"no-internal-links")) {
421 i->second->discardAllCrossings(
false);
428 if (oc.
isSet(
"tls.set")) {
429 std::vector<std::string> tlControlledNodes = oc.
getStringVector(
"tls.set");
431 for (std::vector<std::string>::const_iterator i = tlControlledNodes.begin(); i != tlControlledNodes.end(); ++i) {
434 WRITE_WARNING(
"Building a tl-logic for junction '" + *i +
"' is not possible." +
"\n The junction '" + *i +
"' is not known.");
467 std::string progCount =
"";
468 if (numbers.first != numbers.second) {
469 progCount =
"(" +
toString(numbers.second) +
" programs) ";
473 if (oc.
isSet(
"street-sign-output")) {
481 (*i).second->sortOutgoingConnectionsByIndex();
484 if (!oc.
getBool(
"no-internal-links")) {
489 (*i).second->buildInnerEdges();
494 if (oc.
getFloat(
"junctions.scurve-stretch") > 0) {
502 (*i).second->buildInnerEdges();
510 if (oc.
exists(
"geometry.check-overlap") && oc.
getFloat(
"geometry.check-overlap") > 0) {
525 if (oc.
exists(
"ptstop-output") && oc.
isSet(
"ptstop-output")) {
528 double maxRadius = oc.
getFloat(
"osm.stop-output.footway-access-distance");
529 int maxCount = oc.
getInt(
"osm.stop-output.footway-max-accesses");
535 WRITE_MESSAGE(
"-----------------------------------------------------");
542 WRITE_MESSAGE(
"-----------------------------------------------------");
547 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");
569 const double x = -boundary.
xmin();
570 const double y = -(lefthand ? boundary.
ymax() : boundary.
ymin());
575 (*i).second->reshiftPosition(x, y);
578 (*i).second->reshiftPosition(x, y);
581 (*i).second->reshiftPosition(x, y);
584 (*i).second->reshiftPostion(x, y);
595 (*i).second->mirrorX();
598 (*i).second->mirrorX();
601 (*i).second->mirrorX();
616 double z = hm.
getZ(orig);
627 if (maxLength > 0 && from.size() > 1) {
630 for (
int i = 0; i < (int) from.size(); i++) {
636 for (
int i = 0; i < (int)copy.size() - 1; i++) {
637 Position start = from[i + inserted];
638 Position end = from[i + inserted + 1];
639 double length = copy[i].distanceTo(copy[i + 1]);
640 const Position step = (end - start) * (maxLength / length);
642 while (length > maxLength) {
645 from.insert(from.begin() + i + inserted + 1, start + (step * steps));
653 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)
void resetWritable()
Resets all options to be writeable.
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.
void findAccessEdgesForRailStops(NBEdgeCont &cont, double d, int i)
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.
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 checkOverlap(double threshold, double zThreshold) const
check whether edges overlap
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)
static void reportWarnings()
reports warnings if any occured
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
#define PROGRESS_TIME_MESSAGE(before)
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.
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)
void setAsTLControlled(NBNode *node, NBTrafficLightLogicCont &tlc, TrafficLightType type, std::string id="")
Sets the given node as being controlled by a tls.
int guessSidewalks(double width, double minSpeed, double maxSpeed, bool fromPermissions)
add sidwalks to edges within the given limits or permissions and return the number of edges affected ...
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 appendTurnarounds(bool noTLSControlled)
Appends turnarounds to all edges stored in the container.
int remapIDs(bool numericaIDs, bool reservedIDs)
remap node IDs accoring to options –numerical-ids and –reserved-ids
static void computeNodeTypes(NBNodeCont &nc)
Computes node types.
void moveToOrigin(GeoConvHelper &geoConvHelper, bool lefthand)
shift network so its lower left corner is at 0,0
A storage for options typed value containers)
const Position getOffsetBase() const
Returns the network base.
void computeEdgeShapes()
Computes the shapes of all edges stored in the container.
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 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 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.
bool myHaveLoadedNetworkWithoutInternalEdges
whether a .net.xml without internal edges was loaded
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)
int remapIDs(bool numericaIDs, bool reservedIDs)
remap node IDs accoring to options –numerical-ids and –reserved-ids
NBNodeCont myNodeCont
The used container for nodes.
void setTLControllingInformation(const NBEdgeCont &ec, const NBNodeCont &nc)
Informs the edges about being controlled by a tls.
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.
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.