DHART
|
#include <analysis_C.h>
#include <robin_hood.h>
#include <HFExceptions.h>
#include <embree_raytracer.h>
#include <graph_generator.h>
#include <graph.h>
Go to the source code of this file.
Functions | |
template<typename T > | |
std::vector< T > | MapToVector (int length, const T *in_ptr) |
C_INTERFACE | GenerateGraph (HF::RayTracer::EmbreeRayTracer *ray_tracer, const float *start_point, const float *spacing, int MaxNodes, float UpStep, float UpSlope, float DownStep, float DownSlope, int max_step_connections, int min_connections, int core_count, Graph **out_graph) |
Construct a graph by performing a breadth-first search of accessible space. More... | |
C_INTERFACE | GenerateGraphObstacles (HF::RayTracer::EmbreeRayTracer *ray_tracer, const float *start_point, const float *spacing, int MaxNodes, float UpStep, float UpSlope, float DownStep, float DownSlope, int max_step_connections, int min_connections, int core_count, const int *obstacle_ids, const int *walkable_ids, int num_obstacles, int num_walkables, Graph **out_graph) |
Construct a graph by performing a breadth-first search of accessible space, seperating obstacles from walkable geometry. More... | |
std::vector< T > MapToVector | ( | int | length, |
const T * | in_ptr | ||
) |
Definition at line 15 of file analysis_C.cpp.
Referenced by GenerateGraphObstacles().