111 lines
3.0 KiB
C++
111 lines
3.0 KiB
C++
/*
|
|
----
|
|
This file is part of SECONDO.
|
|
|
|
Copyright (C) 2004, University in Hagen, Department of Computer Science,
|
|
Database Systems for New Applications.
|
|
|
|
SECONDO is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
SECONDO 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 General Public License
|
|
along with SECONDO; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
----
|
|
|
|
//paragraph [1] Title: [{\Large \bf \begin {center}] [\end {center}}]
|
|
//[TOC] [\tableofcontents]
|
|
//[_] [\_]
|
|
|
|
[1] Header File of the MapMatching Algebra
|
|
|
|
April, 2012. Matthias Roth
|
|
|
|
[TOC]
|
|
|
|
1 Overview
|
|
|
|
This header file essentially contains the definition of the class
|
|
~MGPointCreator~.
|
|
|
|
2 Defines and includes
|
|
|
|
*/
|
|
|
|
#ifndef __MAPMATCHINGMHTMGPOINTCREATOR_H_
|
|
#define __MAPMATCHINGMHTMGPOINTCREATOR_H_
|
|
|
|
#include "MapMatchingMHT.h"
|
|
#include "MHTRouteCandidate.h"
|
|
#include "Algebras/Temporal/TemporalAlgebra.h"
|
|
#include "Algebras/Network/NetworkAlgebra.h"
|
|
#include "Algebras/TemporalNet/TemporalNetAlgebra.h"
|
|
|
|
|
|
namespace datetime
|
|
{
|
|
class DateTime;
|
|
}
|
|
|
|
|
|
namespace mapmatch {
|
|
|
|
class NetworkAdapter;
|
|
|
|
/*
|
|
3 class MGPointCreator
|
|
|
|
*/
|
|
class MGPointCreator : public IMapMatchingMHTResultCreator
|
|
{
|
|
public:
|
|
|
|
MGPointCreator(NetworkAdapter* pNetworkAdapter,
|
|
temporalnet::MGPoint* pResMGPoint);
|
|
virtual ~MGPointCreator();
|
|
|
|
virtual bool CreateResult(const std::vector<MHTRouteCandidate*>&
|
|
rvecRouteCandidates);
|
|
|
|
private:
|
|
|
|
bool Init(void);
|
|
void Finalize(void);
|
|
|
|
const AttributePtr<network::GPoint> GetGPoint(
|
|
const MHTRouteCandidate::PointDataPtr& pData,
|
|
const int& nNetworkId,
|
|
const double& dNetworkScale) const;
|
|
|
|
void AddUGPoint(const temporalnet::UGPoint& rAktUGPoint);
|
|
|
|
bool CalcShortestPath(const network::GPoint* pGPStart,
|
|
const network::GPoint* pGPEnd,
|
|
const datetime::DateTime& rtimeStart,
|
|
const datetime::DateTime& rtimeEnd,
|
|
const bool bCheckSpeed);
|
|
|
|
bool ConnectPoints(const network::GPoint& rGPStart,
|
|
const network::GPoint& rGPEnd,
|
|
const temporalalgebra::Interval<Instant>&
|
|
rTimeInterval);
|
|
|
|
const network::Network* m_pNetwork;
|
|
double m_dNetworkScale;
|
|
temporalnet::MGPoint* m_pResMGPoint;
|
|
network::RITreeP* m_pRITree;
|
|
};
|
|
|
|
|
|
} // end of namespace mapmatch
|
|
|
|
|
|
#endif /* __MAPMATCHINGMHTMGPOINTCREATOR_H_ */
|