godot/thirdparty/rvo2/rvo2_2d/KdTree2d.cpp

/*
 * KdTree2d.cpp
 * RVO2 Library
 *
 * Copyright 2008 University of North Carolina at Chapel Hill
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 * Please send all bug reports to <[email protected]>.
 *
 * The authors may be contacted via:
 *
 * Jur van den Berg, Stephen J. Guy, Jamie Snape, Ming C. Lin, Dinesh Manocha
 * Dept. of Computer Science
 * 201 S. Columbia St.
 * Frederick P. Brooks, Jr. Computer Science Bldg.
 * Chapel Hill, N.C. 27599-3175
 * United States of America
 *
 * <http://gamma.cs.unc.edu/RVO2/>
 */

#include "KdTree2d.h"

#include "Agent2d.h"
#include "RVOSimulator2d.h"
#include "Obstacle2d.h"

namespace RVO2D {
	KdTree2D::KdTree2D(RVOSimulator2D *sim) : … { … }

	KdTree2D::~KdTree2D()
	{ … }

	void KdTree2D::buildAgentTree(std::vector<Agent2D *> agents)
	{ … }

	void KdTree2D::buildAgentTreeRecursive(size_t begin, size_t end, size_t node)
	{ … }

	void KdTree2D::buildObstacleTree(std::vector<Obstacle2D *> obstacles)
	{ … }


	KdTree2D::ObstacleTreeNode *KdTree2D::buildObstacleTreeRecursive(const std::vector<Obstacle2D *> &obstacles)
	{ … }

	void KdTree2D::computeAgentNeighbors(Agent2D *agent, float &rangeSq) const
	{ … }

	void KdTree2D::computeObstacleNeighbors(Agent2D *agent, float rangeSq) const
	{ … }

	void KdTree2D::deleteObstacleTree(ObstacleTreeNode *node)
	{ … }

	void KdTree2D::queryAgentTreeRecursive(Agent2D *agent, float &rangeSq, size_t node) const
	{ … }

	void KdTree2D::queryObstacleTreeRecursive(Agent2D *agent, float rangeSq, const ObstacleTreeNode *node) const
	{ … }

	bool KdTree2D::queryVisibility(const Vector2 &q1, const Vector2 &q2, float radius) const
	{ … }

	bool KdTree2D::queryVisibilityRecursive(const Vector2 &q1, const Vector2 &q2, float radius, const ObstacleTreeNode *node) const
	{ … }
}