13 #include <MinSG/Core/Nodes/ListNode.h> 15 #include <boost/graph/adjacency_list.hpp> 33 std::vector<MinSG::GeometryNode*>
35 const MinSG::ListNode& root
48 std::vector<MeshAccessor*>
50 const std::vector<MinSG::GeometryNode*>& nodes
69 const Geometry::Vec3& v,
70 const Geometry::Vec3& w
91 const std::vector<MinSG::GeometryNode*>& nodes,
92 const std::vector<MeshAccessor*>& meshAccessors
This file declares the struct MeshAccessor that presents a convenient way to access meshes...
std::vector< Graph * > buildGraphList(const std::vector< MinSG::GeometryNode *> &nodes, const std::vector< MeshAccessor *> &meshAccessors)
Build a graph for every mesh of a scene graph.
Definition: BuildGraph.cpp:108
std::vector< MinSG::GeometryNode * > extractGeometryNodes(const MinSG::ListNode &root)
Build a list of all GeometryNodes in the scene graph.
Definition: BuildGraph.cpp:28
short determineDrivability(const Geometry::Vec3 &v, const Geometry::Vec3 &w)
Determine which agent is able to traverse the direct connection between the two points.
Definition: BuildGraph.cpp:75
std::vector< MeshAccessor * > createMeshAccessors(const std::vector< MinSG::GeometryNode *> &nodes)
Create MeshAccessor objects for the given GeometryNodes.
Definition: BuildGraph.cpp:63
This file provides using and enum declarations.