DHART
|
Contains implementation for the VisibilityGraph class. More...
#include <visibility_graph.h>
#include <array>
#include <thread>
#include <omp.h>
#include <algorithm>
#include <robin_hood.h>
#include <graph.h>
#include <embree_raytracer.h>
#include <Edge.h>
#include <node.h>
#include <Constants.h>
Go to the source code of this file.
Namespaces | |
namespace | HF |
Perform human scale analysis on 3D environments. | |
namespace | HF::VisibilityGraph |
Evaluate visibility between points in a set of locations. | |
Functions | |
bool | HF::VisibilityGraph::HeightCheck (const Node &Node, float height, EmbreeRayTracer &ert) |
Check if Node can be raised by height without clipping into any geometry. More... | |
vector< int > | HF::VisibilityGraph::HeightCheckAllNodes (const vector< Node > &nodes_to_filter, float height, EmbreeRayTracer &ert) |
Obtain the indexes of all nodes that pass the HeightCheck. More... | |
bool | HF::VisibilityGraph::IsOcclusionBetween (const Node &node_a, const Node &node_b, EmbreeRayTracer &ert, float height=1.7f, float pre_calculated_distance=0.0f) |
Perform a line of sight check between two nodes. More... | |
Graph | HF::VisibilityGraph::AllToAll (HF::RayTracer::EmbreeRayTracer &ert, const std::vector< HF::SpatialStructures::Node > &input_nodes, float height=1.7f) |
Generate a Visibility Graph between every node in a set of nodes in parallel. More... | |
Graph | HF::VisibilityGraph::GroupToGroup (HF::RayTracer::EmbreeRayTracer &ert, const std::vector< HF::SpatialStructures::Node > &from, const std::vector< HF::SpatialStructures::Node > &to, float height=1.7f) |
Generate a Visibility Graph from a set of nodes to another set of nodes. More... | |
Graph | HF::VisibilityGraph::AllToAllUndirected (HF::RayTracer::EmbreeRayTracer &ert, const std::vector< HF::SpatialStructures::Node > &nodes, float height, int cores=-1) |
Generate a Visibility Graph with every edge stored twice. More... | |
Contains implementation for the VisibilityGraph class.
Definition in file visibility_graph.cpp.