An example about using a kdtree to spatially index the vertexes of a mesh. More...
#include <vcg/complex/complex.h>#include <wrap/io_trimesh/import.h>#include <wrap/io_trimesh/export.h>#include <vcg/space/index/kdtree/kdtree.h>#include <vcg/complex/algorithms/update/normal.h>#include <vcg/complex/algorithms/update/color.h>
Include dependency graph for trimesh_kdtree.cpp:
Go to the source code of this file.
Classes | |
| class | MyEdge |
| class | MyFace |
| class | MyMesh |
| struct | MyUsedTypes |
| class | MyVertex |
Functions | |
| int | main (int argc, char **argv) |
Detailed Description
An example about using a kdtree to spatially index the vertexes of a mesh.
KdTree are one of the Spatial indexing data structures available. They are tailored for storing point-based structures and performing k-neighbours queries. In this simple example we simply compute the average distance of a vertex from its neighbours. spatial_indexing for more Details
Definition in file trimesh_kdtree.cpp.
Function Documentation
| int main | ( | int | argc, |
| char ** | argv | ||
| ) |
Definition at line 57 of file trimesh_kdtree.cpp.