43 void PartitionMesh(
const float* verts,
const int*
tris,
int numTris,
int trisPerChunk);
Definition PartitionedMesh.h:28
int numTris
Definition PartitionedMesh.h:34
float bmin[2]
Definition PartitionedMesh.h:30
int triIndex
Definition PartitionedMesh.h:33
float bmax[2]
Definition PartitionedMesh.h:31
A spatially-partitioned mesh (k/d tree), where each node contains at max trisPerChunk triangles.
Definition PartitionedMesh.h:26
void GetNodesOverlappingSegment(float start[2], float end[2], std::vector< int > &outNodes) const
Returns the chunk indices which overlap the input segment.
Definition PartitionedMesh.cpp:255
void PartitionMesh(const float *verts, const int *tris, int numTris, int trisPerChunk)
Definition PartitionedMesh.cpp:183
int maxTrisPerChunk
Definition PartitionedMesh.h:41
std::vector< Node > nodes
Definition PartitionedMesh.h:37
std::vector< int > tris
Definition PartitionedMesh.h:40
void GetNodesOverlappingRect(float bmin[2], float bmax[2], std::vector< int > &outNodes) const
Finds the chunk indices that overlap the input rectangle.
Definition PartitionedMesh.cpp:229
int nnodes
Definition PartitionedMesh.h:38