You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58 lines
1.6 KiB
C++
58 lines
1.6 KiB
C++
/*
|
|
* Copyright (c) Contributors to the Open 3D Engine Project.
|
|
* For complete copyright and license terms please see the LICENSE at the root of this distribution.
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0 OR MIT
|
|
*
|
|
*/
|
|
|
|
|
|
#ifndef CRYINCLUDE_EDITOR_UTIL_KDTREE_H
|
|
#define CRYINCLUDE_EDITOR_UTIL_KDTREE_H
|
|
#pragma once
|
|
|
|
struct IStatObj;
|
|
|
|
class KDTreeNode;
|
|
|
|
class CKDTree
|
|
{
|
|
public:
|
|
|
|
CKDTree();
|
|
~CKDTree();
|
|
|
|
bool Build(IStatObj* pStatObj);
|
|
bool FindNearestVertex(const Vec3& raySrc, const Vec3& rayDir, float vVertexBoxSize, const Vec3& localCameraPos, Vec3& outPos, Vec3& vOutHitPosOnCube) const;
|
|
void GetPenetratedBoxes(const Vec3& raySrc, const Vec3& rayDir, std::vector<AABB>& outBoxes);
|
|
|
|
enum ESplitAxis
|
|
{
|
|
eSA_X = 0,
|
|
eSA_Y,
|
|
eSA_Z,
|
|
eSA_Invalid
|
|
};
|
|
|
|
struct SStatObj
|
|
{
|
|
Matrix34 tm;
|
|
_smart_ptr<IStatObj> pStatObj;
|
|
};
|
|
|
|
private:
|
|
|
|
void BuildRecursively(KDTreeNode* pNode, const AABB& boundbox, std::vector<uint32>& indices) const;
|
|
bool FindNearestVertexRecursively(KDTreeNode* pNode, const Vec3& raySrc, const Vec3& rayDir, float vVertexBoxSize, const Vec3& localCameraPos, Vec3& outPos, Vec3& vOutHitPosOnCube) const;
|
|
void GetPenetratedBoxesRecursively(KDTreeNode* pNode, const Vec3& raySrc, const Vec3& rayDir, std::vector<AABB>& outBoxes);
|
|
void ConstructStatObjList(IStatObj* pStatObj, const Matrix34& matParent);
|
|
|
|
static const int s_MinimumVertexSizeInLeafNode = 4;
|
|
|
|
private:
|
|
|
|
KDTreeNode* m_pRootNode;
|
|
std::vector<SStatObj> m_StatObjectList;
|
|
};
|
|
#endif // CRYINCLUDE_EDITOR_UTIL_KDTREE_H
|