DHART
Loading...
Searching...
No Matches
DHARTAPI.VisibilityGraph Namespace Reference

Evaluate visibility between a set of points. More...

Classes

class  VisibilityGraph
 Contains all methods for generating Visibility Graphs. More...
 

Detailed Description

Evaluate visibility between a set of points.

A Visibility Graph is a graph of points of space locations that have a clear line of sight to each other. Edges in a Visibility Graph are bidirectional, since if one node can see another node, the inverse is true. Generating a Visibility Graph from a set of nodes consists of performing a line of sight check between each combination of nodes, and creating an edge if the line of sight check passes. In this implementation, the cost of every edge in the visibility graph is equal to the distance between the parent and child nodes.

See also
SpatialStructures.Graph for more information about the type returned from this function.
RayTracing.EmbreeBVH for info on the BVH type required to call these functions.