osm2graph.cpp File Reference

#include <cstdio>
#include <utility>
#include <inttypes.h>
#include <vector>
#include <cstring>
#include <cmath>
#include <algorithm>
#include "SwappyItems.hpp"
#include "osmpbfreader.hpp"

Classes
struct	NodeData
struct	WayData
struct	Vertex
struct	Distance
struct	Routing

Macros
#define	FILE_ITEMS   ( 2*1024)
#define	FILE_MULTI   4
#define	RAM_MULTI   8
#define	BBITS   5
#define	BMASK   ((BBITS+4)* FILE_ITEMS)
#define	TORADI(angleDegrees)   ((angleDegrees) * M_PI / 180.0)
#define	LON_BOUND   5.85
#define	LON_BOUND_DIF   3.62
#define	LAT_BOUND   50.32
#define	LAT_BOUND_DIF   2.2
#define	DEFAULTATTR   " version='1' timestamp='2019-12-20T14:59:00Z' visible='true'"
	build a map file with osmosis: ../osmosis/bin/osmosis –read-xml file=graph.osm –mw file=krefeld_mg.map zoom-interval-conf=7,5,8,11,9,13 threads=2 More...

Typedefs
typedef uint64_t	Key
typedef SwappyItems< Key, WayData, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK >	Ways_t
typedef SwappyItems< Key, NodeData, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK >	Nodes_t
typedef SwappyItems< Key, Vertex, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK >	Vertices_t
typedef SwappyItems< Key, Distance, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK >	Distance_t

Functions
Key	calcDist (double lon1, double lat1, double lon2, double lat2)
int	relevance (const std::string &wt)
int	main (int argc, char **argv)

Variables
Ways_t *	ways
Nodes_t *	nodes
Vertices_t *	verticies
Distance_t *	distances

Macro Definition Documentation

BBITS

#define BBITS   5

BMASK

#define BMASK   ((BBITS+4)* FILE_ITEMS)

DEFAULTATTR

#define DEFAULTATTR   " version='1' timestamp='2019-12-20T14:59:00Z' visible='true'"

build a map file with osmosis: ../osmosis/bin/osmosis –read-xml file=graph.osm –mw file=krefeld_mg.map zoom-interval-conf=7,5,8,11,9,13 threads=2

Examples

osm2graph.cpp.

FILE_ITEMS

#define FILE_ITEMS   ( 2*1024)

FILE_MULTI

#define FILE_MULTI   4

LAT_BOUND

#define LAT_BOUND   50.32

Examples

osm2graph.cpp.

LAT_BOUND_DIF

#define LAT_BOUND_DIF   2.2

Examples

osm2graph.cpp.

LON_BOUND

#define LON_BOUND   5.85

Examples

osm2graph.cpp.

LON_BOUND_DIF

#define LON_BOUND_DIF   3.62

Examples

osm2graph.cpp.

RAM_MULTI

#define RAM_MULTI   8

TORADI

#define TORADI

(

angleDegrees

)

((angleDegrees) * M_PI / 180.0)

Examples

osm2graph.cpp.

Typedef Documentation

Distance_t

typedef SwappyItems<Key, Distance, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK> Distance_t

Examples

osm2graph.cpp.

Key

typedef uint64_t Key

Examples

osm2graph.cpp.

Nodes_t

typedef SwappyItems<Key, NodeData, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK> Nodes_t

Examples

osm2graph.cpp.

Vertices_t

typedef SwappyItems<Key, Vertex, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK> Vertices_t

Examples

osm2graph.cpp.

Ways_t

typedef SwappyItems<Key, WayData, FILE_ITEMS, FILE_MULTI, RAM_MULTI, BBITS, BMASK> Ways_t

Examples

osm2graph.cpp.

Function Documentation

calcDist()

Key calcDist	(	double	lon1,
		double	lat1,
		double	lon2,
		double	lat2
	)

Examples

osm2graph.cpp.

                                                                 {
    double dist = 6378388.0 * std::acos(std::sin(TORADI(lat1)) * std::sin(TORADI(lat2)) + std::cos(TORADI(lat1)) * std::cos(TORADI(lat2)) * std::cos(TORADI(lon2 - lon1)));
    if (dist < 0) dist *=-1;
    return dist;
}

main()

int main	(	int	argc,
		char **	argv
	)

Examples

osm2graph.cpp.

                                {
    Routing routing;
    ways = new Ways_t(1);
    nodes = new Nodes_t(2);
    
    verticies = new Vertices_t(3);
    distances = new Distance_t(4);
    
    read_osm_pbf(argv[1], routing, true); // ways
 
    read_osm_pbf(argv[1], routing, false); // nodes und bedingungen
    
    // create verticies -------------------------------------------------------------------------------------
    
    Ways_t::Data w;
    ways->each(w, [](Key wayosmid, Ways_t::Data & way) {
        bool firstItem = true;
        Key last;
        double lastLon = 0.0;
        double lastLat = 0.0;
        Key dist = 0;
 
        // create verticies from refs: a->b->c->d->e
        // d link to e(=last)
        // c link to d(=last)
        // ...
        for (unsigned i=0; i < way.second.size(); ++i) {
            Key ref = way.second[way.second.size()-1 - i]; // add actually ref to the last ref (from backward)
            Nodes_t::Data * nptr = nodes->get(ref);
            
            if (nptr == nullptr) continue;
            if (nptr->first._lon == 0 && nptr->first._lat == 0) continue;
            
            // with reduction of nodes
            if (nptr->first._used == 0) {
                if (firstItem == false) {
                    dist += calcDist(nptr->first._lon, nptr->first._lat, lastLon, lastLat);
                    lastLon = nptr->first._lon;
                    lastLat = nptr->first._lat;
                }
                continue;
            }
            
            Vertices_t::Data * vptr = verticies->get(ref);
            Distance_t::Data * dptr = distances->get(ref);
 
            if (vptr == nullptr) {
                Vertices_t::Data vertex;
                Distance_t::Data distance;
                vertex.first._way = wayosmid;
                vertex.first._lon = nptr->first._lon;
                vertex.first._lat = nptr->first._lat;
                if (firstItem) {
                    firstItem = false;
                } else {
                    dist += calcDist(vertex.first._lon, vertex.first._lat, lastLon, lastLat);
                    vertex.second.push_back(last);
                    distance.second.push_back(dist);
                }
                lastLon = nptr->first._lon;
                lastLat = nptr->first._lat;
                verticies->set(ref, vertex.first, vertex.second);
                distances->set(ref, distance.first, distance.second);
            } else {
                if (firstItem) {
                    firstItem = false;
                } else {
                    dist += calcDist(vptr->first._lon, vptr->first._lat, lastLon, lastLat);
                    vptr->second.push_back(last);
                    dptr->second.push_back(dist);
                }
                lastLon = nptr->first._lon;
                lastLat = nptr->first._lat;
                verticies->set(ref, vptr->first, vptr->second);
                distances->set(ref, dptr->first, dptr->second);
            }
            dist = 0;
            last = ref;
        }
        
        // Not a oneway. create verticies from refs in the direction: a<-b<-c<-d<-e
        // b link to a(=last)
        // c link to b(=last)
        // ...
        firstItem = true;
        lastLon = 0.0;
        lastLat = 0.0;
        dist = 0;
        if (way.first._oneway == false) {
            for (unsigned i=0; i < way.second.size(); ++i) {
                Key ref = way.second[i];
                Nodes_t::Data * nptr = nodes->get(ref);
                
                if (nptr == nullptr) continue;
                if (nptr->first._lon == 0 && nptr->first._lat == 0) continue;
            
                // with reduction of nodes
                if (nptr->first._used == 0) {
                    if (firstItem == false) {
                        dist += calcDist(nptr->first._lon, nptr->first._lat, lastLon, lastLat);
                        lastLon = nptr->first._lon;
                        lastLat = nptr->first._lat;
                    }
                    continue;
                }
                
                Vertices_t::Data * vptr = verticies->get(ref);
                Distance_t::Data * dptr = distances->get(ref);
 
                if (vptr == nullptr) {
                    Vertices_t::Data vertex;
                    Distance_t::Data distance;
                    vertex.first._way = wayosmid;
                    vertex.first._lon = nptr->first._lon;
                    vertex.first._lat = nptr->first._lat;
                    if (firstItem) {
                        firstItem = false;
                    } else {
                        dist += calcDist(vertex.first._lon, vertex.first._lat, lastLon, lastLat);
                        vertex.second.push_back(last);
                        distance.second.push_back(dist);
                    }
                    lastLon = nptr->first._lon;
                    lastLat = nptr->first._lat;
                    verticies->set(ref, vertex.first, vertex.second);
                    distances->set(ref, distance.first, distance.second);
                } else {
                    if (firstItem) {
                        firstItem = false;
                    } else {
                        dist += calcDist(vptr->first._lon, vptr->first._lat, lastLon, lastLat);
                        vptr->second.push_back(last);
                        dptr->second.push_back(dist);
                    }
                    lastLon = nptr->first._lon;
                    lastLat = nptr->first._lat;
                    verticies->set(ref, vptr->first, vptr->second);
                    distances->set(ref, dptr->first, dptr->second);
                }
                dist = 0;
                last = ref;
            }
        }
        
        // all items, no stop
        return false;
    });
    
    // verticies to osm ------------------------------------------------
    
    uint64_t wayOsmId = 1;
    FILE * pFile;
    pFile = fopen ("graph.osm","w");
 
    fprintf (pFile, 
        "<?xml version='1.0' encoding='UTF-8'?>\n"
        "<osm version='0.6'>\n"
        "<bounds minlat='%f' minlon='%f' maxlat='%f' maxlon='%f'/>\n",
        LAT_BOUND, LON_BOUND,
        LAT_BOUND + LAT_BOUND_DIF, LON_BOUND + LON_BOUND_DIF
    );
    
    
    Vertices_t::Data dummy;
 
    // all nodes to the beginning!!!
    verticies->each(dummy, [&wayOsmId, &pFile](Key id, Vertices_t::Data & v) {
        //if (v.second.size() > 0) { // no. it could be a single point, where many oneways result in!
        fprintf (pFile, 
            "<node id='%" PRIu64 "'" DEFAULTATTR " lat='%f' lon='%f'/>\n",
            id, v.first._lat, v.first._lon
        );
        // all items, no stop
        return false;
    });
 
    // create the new ways
    verticies->each(dummy, [&wayOsmId, &pFile](Key id, Vertices_t::Data & v) {
        Distance_t::Data * dptr = distances->get(id);
        for (unsigned i=0; i < v.second.size(); ++i) {
            fprintf (pFile, 
                "<way id='%" PRIu64 "'" DEFAULTATTR ">"
                "<nd ref='%" PRIu64 "'/>"
                "<nd ref='%" PRIu64 "'/>"
                "<tag k='highway' v='secondary'/>"
                "<tag k='oneway' v='yes'/>"
                "<tag k='name' v=\"%" PRIu64 "\"/></way>\n",
                wayOsmId,
                id,
                v.second[i],
                dptr->second[i]
            );
            ++wayOsmId;
        }
 
        // all items, no stop
        return false;
    });
 
 
    fprintf (pFile, "</osm>\n");
    fclose (pFile);
 
    delete distances;
    delete verticies;
    delete nodes;
    delete ways;
    
    return 0;
}

relevance()

int relevance

(

const std::string &

wt

)

Examples

osm2graph.cpp.

                                    {
    if (wt.compare("motorway") == 0) return 1;
    if (wt.compare("motorway_link") == 0) return 2;
    if (wt.compare("trunk") == 0) return 1;
    if (wt.compare("trunk_link") == 0) return 2;
    if (wt.compare("primary") == 0) return 1;
    if (wt.compare("primary_link") == 0) return 2;
    if (wt.compare("secondary") == 0) return 1;
    if (wt.compare("secondary_link") == 0) return 2;
    if (wt.compare("unclassified") == 0) return 1;
    if (wt.compare("tertiary") == 0) return 1;
    if (wt.compare("tertiary_link") == 0) return 2;
    if (wt.compare("residential") == 0) return 1;
    return 0;
}

Variable Documentation

distances

Distance_t* distances

Examples

osm2graph.cpp.

nodes

Nodes_t* nodes

Examples

osm2graph.cpp.

verticies

Vertices_t* verticies

Examples

osm2graph.cpp.

ways

Ways_t* ways

Examples

osm2graph.cpp.