161 lines
4.3 KiB
C++
161 lines
4.3 KiB
C++
/**
|
|
* Polyline - store geographic line-segments */
|
|
|
|
// Written by James Turner, started 2013.
|
|
//
|
|
// Copyright (C) 2013 James Turner <zakalawe@mac.com>
|
|
//
|
|
// This program 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.
|
|
//
|
|
// 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 General Public License
|
|
// along with this program; if not, write to the Free Software
|
|
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
|
|
#include "PolyLine.hxx"
|
|
|
|
#include <cassert>
|
|
#include <boost/foreach.hpp>
|
|
|
|
#include <simgear/math/sg_geodesy.hxx>
|
|
|
|
#include <Navaids/PositionedOctree.hxx>
|
|
|
|
using namespace flightgear;
|
|
|
|
PolyLine::PolyLine(Type aTy, const SGGeodVec& aPoints) :
|
|
m_type(aTy),
|
|
m_data(aPoints)
|
|
{
|
|
assert(!aPoints.empty());
|
|
}
|
|
|
|
PolyLine::~PolyLine()
|
|
{
|
|
|
|
}
|
|
|
|
unsigned int PolyLine::numPoints() const
|
|
{
|
|
return m_data.size();
|
|
}
|
|
|
|
SGGeod PolyLine::point(unsigned int aIndex) const
|
|
{
|
|
assert(aIndex <= m_data.size());
|
|
return m_data[aIndex];
|
|
}
|
|
|
|
PolyLineList PolyLine::createChunked(Type aTy, const SGGeodVec& aRawPoints)
|
|
{
|
|
PolyLineList result;
|
|
if (aRawPoints.size() < 2) {
|
|
return result;
|
|
}
|
|
|
|
const double maxDistanceSquaredM = 40000 * 40000; // 40km to start with
|
|
|
|
SGVec3d chunkStartCart = SGVec3d::fromGeod(aRawPoints.front());
|
|
SGGeodVec chunk;
|
|
SGGeodVec::const_iterator it = aRawPoints.begin();
|
|
|
|
while (it != aRawPoints.end()) {
|
|
SGVec3d ptCart = SGVec3d::fromGeod(*it);
|
|
double d2 = distSqr(chunkStartCart, ptCart);
|
|
|
|
// distance check, but also ensure we generate actual valid line segments.
|
|
if ((chunk.size() >= 2) && (d2 > maxDistanceSquaredM)) {
|
|
chunk.push_back(*it); // close the segment
|
|
result.push_back(new PolyLine(aTy, chunk));
|
|
chunkStartCart = ptCart;
|
|
chunk.clear();
|
|
}
|
|
|
|
chunk.push_back(*it++); // add to open chunk
|
|
}
|
|
|
|
// if we have a single trailing point, we already added it as the last
|
|
// point of the previous chunk, so we're ok. Otherwise, create the
|
|
// final chunk's polyline
|
|
if (chunk.size() > 1) {
|
|
result.push_back(new PolyLine(aTy, chunk));
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void PolyLine::addToSpatialIndex() const
|
|
{
|
|
std::set<Octree::Leaf*> seen;
|
|
|
|
BOOST_FOREACH(const SGGeod& g, m_data) {
|
|
SGVec3d cart(SGVec3d::fromGeod(g));
|
|
Octree::Leaf* lf = Octree::global_spatialOctree->findLeafForPos(cart);
|
|
if (seen.find(lf) != seen.end()) {
|
|
continue; // don't insert multiple times
|
|
}
|
|
|
|
lf->addPolyLine(const_cast<PolyLine*>(this));
|
|
} // of data points iteration
|
|
}
|
|
|
|
class SingleTypeFilter : public PolyLine::TypeFilter
|
|
{
|
|
public:
|
|
SingleTypeFilter(PolyLine::Type aTy) :
|
|
m_type(aTy)
|
|
{ }
|
|
|
|
virtual bool pass(PolyLine::Type aTy) const
|
|
{ return (aTy == m_type); }
|
|
private:
|
|
PolyLine::Type m_type;
|
|
};
|
|
|
|
PolyLineList PolyLine::linesNearPos(const SGGeod& aPos, double aRangeNm, Type aTy)
|
|
{
|
|
return linesNearPos(aPos, aRangeNm, SingleTypeFilter(aTy));
|
|
}
|
|
|
|
|
|
PolyLineList PolyLine::linesNearPos(const SGGeod& aPos, double aRangeNm, const TypeFilter& aFilter)
|
|
{
|
|
std::set<PolyLineRef> resultSet;
|
|
|
|
SGVec3d cart = SGVec3d::fromGeod(aPos);
|
|
double cutoffM = aRangeNm * SG_NM_TO_METER;
|
|
Octree::FindLinesDeque deque;
|
|
deque.push_back(Octree::global_spatialOctree);
|
|
|
|
while (!deque.empty()) {
|
|
Octree::Node* nd = deque.front();
|
|
deque.pop_front();
|
|
|
|
PolyLineList lines;
|
|
nd->visitForLines(cart, cutoffM, lines, deque);
|
|
|
|
// merge into result set, filtering as we go.
|
|
BOOST_FOREACH(PolyLineRef ref, lines) {
|
|
if (aFilter.pass(ref->type())) {
|
|
resultSet.insert(ref);
|
|
}
|
|
}
|
|
} // of deque iteration
|
|
|
|
PolyLineList result;
|
|
result.insert(result.end(), resultSet.begin(), resultSet.end());
|
|
return result;
|
|
}
|
|
|
|
|