Spatial Data Structures

List of the Spatial Data Structures of VCLib. More...

Collaboration diagram for Spatial Data Structures:

Classes
class	vcl::AbstractGrid< GridType, ValueType, DerivedGrid >
	The AbstractGrid class describes a generic Spatial Data Structure organized on a regular grid, that allows to store elements (ValueType) in a particular way that will be managed by its derived classes (e.g. StaticGrid, HashTableGrid). More...
class	vcl::HashTableGrid< GridType, ValueType, AllowDuplicates >
	The HashTableGrid class stores N-Dimensional spatial elements (that could be anything on which it can be computed a N-dimensional bounding box) in a regular grid, using a Hash Table having the Cell Grid coordinate as key type. More...
class	vcl::MeshEdgeUtil< MeshType >
	Utility class that represents a edge in a Mesh. More...
class	vcl::MeshInertia< MeshType >
	The MeshInertia class provides several for computing Polyhedral Mass properties (like inertia tensor, volume, etc). More...
class	vcl::MeshInfo
	A simple class that allows to store which elements and their components have been imported/loaded or are going to be exported/saved on a mesh file or some other data structure. More...
class	vcl::MeshPos< FaceType >
	The MeshPos class describes a "Position in a Mesh" that can be identified with a triplet of Face-Vertex-Edge, where: More...
class	vcl::TriPolyIndexBiMap
	The TriPolyIndexBiMap class allows to store a bidirectional mapping between a Polygon Mesh and a Triangle Mesh generated by the polygon mesh. More...

Detailed Description

List of the Spatial Data Structures of VCLib.

In this module, you can find the spatial data structures of VCLib, such as graphs, grids, kd-trees, and samplers.

You can access all the algorithms of VCLib by including #include <vclib/space/complex.h>