pgr_alphaShape.cpp File Reference

#include "alphaShape/pgr_alphaShape.h"
#include <visitors/dijkstra_one_goal_visitor.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/geometry/algorithms/num_points.hpp>
#include <boost/geometry/algorithms/append.hpp>
#include <boost/geometry/algorithms/area.hpp>
#include <boost/geometry/strategies/agnostic/point_in_point.hpp>
#include <boost/geometry/algorithms/correct.hpp>
#include <boost/geometry/algorithms/distance.hpp>
#include <sstream>
#include <set>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include "cpp_common/interruption.h"

Include dependency graph for pgr_alphaShape.cpp:

Go to the source code of this file.

Classes
struct	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::CompareRadius

Namespaces
	pgrouting
	Book keeping class for swapping orders between vehicles.
	pgrouting::alphashape
	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}

Typedefs
typedef std::pair< Triangle, double >	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::MyPairType

Functions
Bpoint	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::circumcenter (const Bpoint a, const Bpoint b, const Bpoint c)
double	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::det (double r00, double r01, double r10, double r11)
template<typename B_G , typename V >
Bpoly	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::get_polygon (V source, V target, const std::vector< V > &predecessors, const B_G &graph, std::set< E > &edges_used)
template<typename B_G , typename V >
std::vector< V >	pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::get_predecessors (V source, V target, const B_G &subg)
std::ostream &	pgrouting::alphashape::operator<< (std::ostream &os, const Pgr_alphaShape &d)