C# Class RVO.KdTree

Defines k-D trees for agents and static obstacles in the * simulation.

Datei anzeigen Open project: snape/RVO2-CS Class Usage Examples

Private Methods

Method	Description
buildAgentTree ( ) : void	Builds an agent k-D tree.
buildAgentTreeRecursive ( int begin, int end, int node ) : void	Recursive method for building an agent k-D tree.
buildObstacleTree ( ) : void	Builds an obstacle k-D tree.
buildObstacleTreeRecursive ( IList obstacles ) : ObstacleTreeNode	Recursive method for building an obstacle k-D tree. *
computeAgentNeighbors ( RVO.Agent agent, float &rangeSq ) : void	Computes the agent neighbors of the specified agent. *
computeObstacleNeighbors ( RVO.Agent agent, float rangeSq ) : void	Computes the obstacle neighbors of the specified agent. *
queryAgentTreeRecursive ( RVO.Agent agent, float &rangeSq, int node ) : void	Recursive method for computing the agent neighbors of the * specified agent.
queryObstacleTreeRecursive ( RVO.Agent agent, float rangeSq, ObstacleTreeNode node ) : void	Recursive method for computing the obstacle neighbors of the * specified agent.
queryVisibility ( Vector2 q1, Vector2 q2, float radius ) : bool	Queries the visibility between two points within a specified * radius.
queryVisibilityRecursive ( Vector2 q1, Vector2 q2, float radius, ObstacleTreeNode node ) : bool	Recursive method for querying the visibility between two * points within a specified radius.