208 lines
6.6 KiB
C++
208 lines
6.6 KiB
C++
/*
|
|
open source routing machine
|
|
Copyright (C) Dennis Luxen, 2010
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU AFFERO General Public License as published by
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Affero General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
or see http://www.gnu.org/licenses/agpl.txt.
|
|
*/
|
|
|
|
#ifndef BASE_DESCRIPTOR_H_
|
|
#define BASE_DESCRIPTOR_H_
|
|
|
|
#include <cassert>
|
|
#include <cmath>
|
|
#include <cstdio>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "../typedefs.h"
|
|
#include "../DataStructures/ExtractorStructs.h"
|
|
#include "../DataStructures/HashTable.h"
|
|
#include "../DataStructures/PolylineCompressor.h"
|
|
#include "../Util/StringUtil.h"
|
|
|
|
#include "RawRouteData.h"
|
|
|
|
static double areaThresholds[19] = { 5000, 5000, 5000, 5000, 5000, 2500, 2000, 1500, 800, 400, 250, 150, 100, 75, 25, 20, 10, 5, 0 };
|
|
|
|
/* Get angle of line segment (A,C)->(C,B), atan2 magic, formerly cosine theorem*/
|
|
static double GetAngleBetweenTwoEdges(const _Coordinate& A, const _Coordinate& C, const _Coordinate& B) {
|
|
int v1x = A.lon - C.lon;
|
|
int v1y = A.lat - C.lat;
|
|
int v2x = B.lon - C.lon;
|
|
int v2y = B.lat - C.lat;
|
|
|
|
double angle = (atan2((double)v2y,v2x) - atan2((double)v1y,v1x) )*180/M_PI;
|
|
while(angle < 0)
|
|
angle += 360;
|
|
|
|
return angle;
|
|
}
|
|
|
|
struct RouteSummary {
|
|
std::string lengthString;
|
|
std::string durationString;
|
|
std::string startName;
|
|
std::string destName;
|
|
RouteSummary() : lengthString("0"), durationString("0"), startName("unknown street"), destName("unknown street") {}
|
|
void BuildDurationAndLengthStrings(double distance, unsigned time) {
|
|
//compute distance/duration for route summary
|
|
std::ostringstream s;
|
|
s << 10*(round(distance/10.));
|
|
lengthString = s.str();
|
|
int travelTime = 60*(time/60.) + 1;
|
|
s.str("");
|
|
s << travelTime;
|
|
durationString = s.str();
|
|
}
|
|
};
|
|
|
|
struct DirectionOfInstruction {
|
|
std::string direction;
|
|
std::string shortDirection;
|
|
};
|
|
|
|
struct DescriptorState {
|
|
_Coordinate currentCoordinate, nextCoordinate, previousCoordinate, tmpCoord, startOfSegmentCoordinate;
|
|
std::string routeGeometryString;
|
|
std::string routeInstructionString;
|
|
unsigned lastNameID, currentNameID, geometryCounter, startIndexOfGeometry;
|
|
double entireDistance, distanceOfInstruction, durationOfInstruction;
|
|
|
|
DescriptorState() : lastNameID(0), currentNameID(0), geometryCounter(0), startIndexOfGeometry(0), entireDistance(0.), distanceOfInstruction(0.), durationOfInstruction(0.) {};
|
|
double GetAngleBetweenCoordinates() const {
|
|
return GetAngleBetweenTwoEdges(previousCoordinate, currentCoordinate, nextCoordinate);
|
|
}
|
|
bool CurrentAndPreviousNameIDsEqual() const {
|
|
return lastNameID == currentNameID;
|
|
}
|
|
void SetStartOfSegment() {
|
|
startOfSegmentCoordinate = nextCoordinate;
|
|
entireDistance += distanceOfInstruction;
|
|
lastNameID = currentNameID;
|
|
distanceOfInstruction = 0;
|
|
startIndexOfGeometry = geometryCounter-1;
|
|
}
|
|
void PrintCoordinates() {
|
|
#ifdef DEBUG
|
|
std::cout << "prev: " << previousCoordinate << ", curr: " << currentCoordinate << ", next: " << nextCoordinate << std::endl;
|
|
#endif
|
|
}
|
|
};
|
|
|
|
struct _DescriptorConfig {
|
|
_DescriptorConfig() : instructions(true), geometry(true), encodeGeometry(false), z(18) {}
|
|
bool instructions;
|
|
bool geometry;
|
|
bool encodeGeometry;
|
|
unsigned short z;
|
|
|
|
PolylineCompressor pc;
|
|
};
|
|
|
|
template<class SearchEngineT>
|
|
class BaseDescriptor {
|
|
public:
|
|
BaseDescriptor() { }
|
|
//Maybe someone can explain the pure virtual destructor thing to me (dennis)
|
|
virtual ~BaseDescriptor() { }
|
|
virtual void Run(http::Reply & reply, RawRouteData &rawRoute, PhantomNodes &phantomNodes, SearchEngineT &sEngine, unsigned distance) = 0;
|
|
virtual void SetConfig(const _DescriptorConfig & config) = 0;
|
|
};
|
|
|
|
static inline void getDirectionOfInstruction(double angle, DirectionOfInstruction & dirInst) {
|
|
if(angle >= 23 && angle < 67) {
|
|
dirInst.direction = "southeast";
|
|
dirInst.shortDirection = "SE";
|
|
return;
|
|
}
|
|
if(angle >= 67 && angle < 113) {
|
|
dirInst.direction = "south";
|
|
dirInst.shortDirection = "S";
|
|
return;
|
|
}
|
|
if(angle >= 113 && angle < 158) {
|
|
dirInst.direction = "southwest";
|
|
dirInst.shortDirection = "SW";
|
|
return;
|
|
}
|
|
if(angle >= 158 && angle < 202) {
|
|
dirInst.direction = "west";
|
|
dirInst.shortDirection = "W";
|
|
return;
|
|
}
|
|
if(angle >= 202 && angle < 248) {
|
|
dirInst.direction = "northwest";
|
|
dirInst.shortDirection = "NW";
|
|
return;
|
|
}
|
|
if(angle >= 248 && angle < 292) {
|
|
dirInst.direction = "north";
|
|
dirInst.shortDirection = "N";
|
|
return;
|
|
}
|
|
if(angle >= 292 && angle < 336) {
|
|
dirInst.direction = "northeast";
|
|
dirInst.shortDirection = "NE";
|
|
return;
|
|
}
|
|
dirInst.direction = "East";
|
|
dirInst.shortDirection = "E";
|
|
return;
|
|
}
|
|
|
|
static inline void getTurnDirectionOfInstruction(double angle, std::string & output) {
|
|
if(angle >= 23 && angle < 67) {
|
|
output = "Turn sharp right";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
if (angle >= 67 && angle < 113) {
|
|
output = "Turn right";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
if (angle >= 113 && angle < 158) {
|
|
output = "Bear right";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
|
|
if (angle >= 158 && angle < 202) {
|
|
output = "Continue";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
if (angle >= 202 && angle < 248) {
|
|
output = "Bear left";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
if (angle >= 248 && angle < 292) {
|
|
output = "Turn left";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
if (angle >= 292 && angle < 336) {
|
|
output = "Turn sharp left";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
return;
|
|
}
|
|
output = "U-Turn";
|
|
// cout << "angle " << angle << "-> " << output << endl;
|
|
}
|
|
|
|
#endif /* BASE_DESCRIPTOR_H_ */
|