DynamicMapTree Class Reference

#include <DynamicTree.h>

Public Member Functions
	DynamicMapTree ()
	~DynamicMapTree ()
bool	isInLineOfSight (float x1, float y1, float z1, float x2, float y2, float z2, uint32 phasemask) const
bool	getIntersectionTime (uint32 phasemask, const G3D::Ray &ray, const G3D::Vector3 &endPos, float &maxDist) const
bool	getObjectHitPos (uint32 phasemask, const G3D::Vector3 &pPos1, const G3D::Vector3 &pPos2, G3D::Vector3 &pResultHitPos, float pModifyDist) const
float	getHeight (float x, float y, float z, float maxSearchDist, uint32 phasemask) const
void	insert (const GameObjectModel &)
void	remove (const GameObjectModel &)
bool	contains (const GameObjectModel &) const
int	size () const
void	balance ()
void	update (uint32 diff)

Private Attributes
DynTreeImpl *	impl

Constructor & Destructor Documentation

DynamicMapTree::DynamicMapTree

(

)

: impl(new DynTreeImpl()) { }

DynamicMapTree::~DynamicMapTree

(

)

{
 delete impl;
}

Member Function Documentation

void DynamicMapTree::balance

(

)

{
 impl->balance();
}

Here is the call graph for this function:

bool DynamicMapTree::contains

(

const GameObjectModel &

mdl

)

const

{
 return impl->contains(mdl);
}

Here is the call graph for this function:

float DynamicMapTree::getHeight	(	float	x,
		float	y,
		float	z,
		float	maxSearchDist,
		uint32	phasemask
	)		const

{
 G3D::Vector3 v(x, y, z);
 G3D::Ray r(v, G3D::Vector3(0, 0, -1));
 DynamicTreeIntersectionCallback callback(phasemask);
 impl->intersectZAllignedRay(r, callback, maxSearchDist);

 if (callback.didHit())
 return v.z - maxSearchDist;
 else
 return -G3D::finf();
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool DynamicMapTree::getIntersectionTime	(	uint32	phasemask,
		const G3D::Ray &	ray,
		const G3D::Vector3 &	endPos,
		float &	maxDist
	)		const

{
 float distance = maxDist;
 DynamicTreeIntersectionCallback callback(phasemask);
 impl->intersectRay(ray, callback, distance, endPos);
 if (callback.didHit())
 maxDist = distance;
 return callback.didHit();
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool DynamicMapTree::getObjectHitPos	(	uint32	phasemask,
		const G3D::Vector3 &	pPos1,
		const G3D::Vector3 &	pPos2,
		G3D::Vector3 &	pResultHitPos,
		float	pModifyDist
	)		const

{
 bool result = false;
 float maxDist = (endPos - startPos).magnitude();
 // valid map coords should *never ever* produce float overflow, but this would produce NaNs too
 ASSERT(maxDist < std::numeric_limits<float>::max());
 // prevent NaN values which can cause BIH intersection to enter infinite loop
 if (maxDist < 1e-10f)
 {
 resultHit = endPos;
 return false;
 }
 G3D::Vector3 dir = (endPos - startPos)/maxDist; // direction with length of 1
 G3D::Ray ray(startPos, dir);
 float dist = maxDist;
 if (getIntersectionTime(phasemask, ray, endPos, dist))
 {
 resultHit = startPos + dir * dist;
 if (modifyDist < 0)
 {
 if ((resultHit - startPos).magnitude() > -modifyDist)
 resultHit = resultHit + dir*modifyDist;
 else
 resultHit = startPos;
 }
 else
 resultHit = resultHit + dir*modifyDist;

 result = true;
 }
 else
 {
 resultHit = endPos;
 result = false;
 }
 return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void DynamicMapTree::insert

(

const GameObjectModel &

mdl

)

{
 impl->insert(mdl);
}

Here is the call graph for this function:

bool DynamicMapTree::isInLineOfSight	(	float	x1,
		float	y1,
		float	z1,
		float	x2,
		float	y2,
		float	z2,
		uint32	phasemask
	)		const

{
 G3D::Vector3 v1(x1, y1, z1), v2(x2, y2, z2);

 float maxDist = (v2 - v1).magnitude();

 if (!G3D::fuzzyGt(maxDist, 0) )
 return true;

 G3D::Ray r(v1, (v2-v1) / maxDist);
 DynamicTreeIntersectionCallback callback(phasemask);
 impl->intersectRay(r, callback, maxDist, v2);

 return !callback.did_hit;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void DynamicMapTree::remove

(

const GameObjectModel &

mdl

)

{
 impl->remove(mdl);
}

Here is the call graph for this function:

int DynamicMapTree::size

(

)

const

{
 return impl->size();
}

Here is the call graph for this function:

void DynamicMapTree::update

(

uint32

diff

)

{
 impl->update(t_diff);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

DynTreeImpl* DynamicMapTree::impl

private

---

The documentation for this class was generated from the following files:

• src/common/Collision/DynamicTree.h
• src/common/Collision/DynamicTree.cpp