Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

New plugin "Nearest" locates the nearest point on an edge to a given input coordinate. Needed for draggable routes.

Browse Source
This commit is contained in:
Dennis Luxen
2011-03-29 15:02:07 +00:00
parent 929793f7a8
commit 3a421f04ad
5 changed files with 143 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
DataStructures/NNGrid.h
+26 -5
View File
@@ -327,7 +327,7 @@ public:
return true;
}
_Coordinate FindNearestPointOnEdge(const _Coordinate& inputCoordinate) {
void FindNearestNodeInGraph(const _Coordinate& inputCoordinate, _Coordinate& outputCoordinate) {
unsigned fileIndex = GetFileIndexForLatLon(100000*(lat2y(static_cast<double>(inputCoordinate.lat)/100000.)), inputCoordinate.lon);
std::vector<_Edge> candidates;
double timestamp = get_timestamp();
@@ -336,7 +336,7 @@ public:
GetContentsOfFileBucket(fileIndex+i+j, candidates);
}
}
_Coordinate nearest(numeric_limits<int>::max(), numeric_limits<int>::max()), tmp;
_Coordinate tmp;
double dist = numeric_limits<double>::max();
timestamp = get_timestamp();
for(std::vector<_Edge>::iterator it = candidates.begin(); it != candidates.end(); it++) {
@@ -344,13 +344,34 @@ public:
double tmpDist = ComputeDistance(inputCoordinate, it->startCoord, it->targetCoord, tmp, &r);
if(tmpDist < dist) {
dist = tmpDist;
nearest = tmp;
outputCoordinate = tmp;
}
}
nearest.lat = 100000*(y2lat(static_cast<double>(nearest.lat)/100000.));
return nearest;
outputCoordinate.lat = 100000*(y2lat(static_cast<double>(outputCoordinate.lat)/100000.));
}
void FindNearestPointOnEdge(const _Coordinate& inputCoordinate, _Coordinate& outputCoordinate) {
unsigned fileIndex = GetFileIndexForLatLon(100000*(lat2y(static_cast<double>(inputCoordinate.lat)/100000.)), inputCoordinate.lon);
std::vector<_Edge> candidates;
for(int j = -32768; j < (32768+1); j+=32768) {
for(int i = -1; i < 2; i++) {
GetContentsOfFileBucket(fileIndex+i+j, candidates);
}
}
_Coordinate tmp;
double dist = numeric_limits<double>::max();
for(std::vector<_Edge>::iterator it = candidates.begin(); it != candidates.end(); it++) {
double r = 0.;
double tmpDist = ComputeDistance(inputCoordinate, it->startCoord, it->targetCoord, tmp, &r);
if(tmpDist < dist) {
dist = tmpDist;
outputCoordinate.lat = round(100000*(y2lat(static_cast<double>(tmp.lat)/100000.)));
outputCoordinate.lon = tmp.lon;
}
}
}
private:
unsigned FillCell(std::vector<GridEntry>& entriesWithSameRAMIndex, unsigned fileOffset )
{
DataStructures/NodeInformationHelpDesk.h
+6 -2
View File
@@ -58,8 +58,8 @@ public:
NodeID getNumberOfNodes() const { return numberOfNodes; }
NodeID getNumberOfNodes2() const { return int2ExtNodeMap->size(); }
inline void findNearestNodeCoordForLatLon(const _Coordinate coord, _Coordinate& result) {
result = readOnlyGrid->FindNearestPointOnEdge(coord);
inline void FindNearestNodeCoordForLatLon(const _Coordinate coord, _Coordinate& result) {
readOnlyGrid->FindNearestNodeInGraph(coord, result);
}
inline bool FindRoutingStarts(const _Coordinate start, const _Coordinate target, PhantomNodes * phantomNodes) {
@@ -67,6 +67,10 @@ public:
return true;
}
inline void FindNearestPointOnEdge(const _Coordinate & input, _Coordinate& output){
readOnlyGrid->FindNearestPointOnEdge(input, output);
}
inline void RegisterThread(const unsigned k, const unsigned v) {
readOnlyGrid->threadLookup.Add(k, v);
}