/usr/include/crystalspace-2.0/csgeom/bsptree.h is in libcrystalspace-dev 2.0+dfsg-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 | /*
Copyright (C) 2004 by Jorrit Tyberghein
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef __CS_CSGEOM_BSPTREE_H__
#define __CS_CSGEOM_BSPTREE_H__
#include "csextern.h"
#include "csgeom/plane3.h"
#include "csgfx/trianglestream.h"
#include "csutil/array.h"
#include "csutil/blockallocator.h"
#include "csutil/dirtyaccessarray.h"
#include "csutil/set.h"
/**\file
* BSP tree implementation.
*/
/**\addtogroup geom_utils
* @{ */
struct iGraphics3D;
struct csTriangle;
/**
* This BSP-tree is a binary tree that organizes a triangle mesh.
* This tree will not split triangles. If a triangle needs to be split
* then it will be put in the two nodes.
*/
class CS_CRYSTALSPACE_EXPORT csBSPTree : public CS::Memory::CustomAllocated
{
private:
CS_DECLARE_STATIC_CLASSVAR_REF(b2fArray, B2fArray, csDirtyAccessArray<int>)
csBSPTree* child1; // If child1 is not 0 then child2 will
csBSPTree* child2; // also be not 0.
csPlane3 split_plane;
csArray<int> splitters;
size_t FindBestSplitter (csTriangle* triangles, csPlane3* planes,
size_t num_triangles, const csVector3* vertices,
const csArray<int>& triidx);
void Build (csTriangle* triangles, csPlane3* planes,
size_t num_triangles, const csVector3* vertices,
const csArray<int>& triidx);
void Back2Front (const csVector3& pos, csDirtyAccessArray<int>& arr,
csSet<int>& used_indices);
public:
/// Create a new empty BSP-tree.
csBSPTree ();
/// Destroy the BSP-tree.
~csBSPTree ();
/// Clear the BSP-tree.
void Clear ();
//@{
/**
* Build the BSP tree given the set of triangles.
*/
void Build (csTriangle* triangles, size_t num_triangles,
const csVector3* vertices);
void Build (CS::TriangleIndicesStream<int>& triangles, const csVector3* vertices);
//@}
/**
* Traverse the tree from back to front. This will return an array
* containing the triangle indices in back2front order. The array
* will not contain double elements.
*/
const csDirtyAccessArray<int>& Back2Front (const csVector3& pos);
};
/** @} */
#endif // __CS_CSGEOM_BSPTREE_H__
|