#include <perfect_spatial_hashing.h>
Public Member Functions | |
bool | operator< (const PreImage &second) const |
PreImage (EntryCoordinate &at, std::vector< typename UniformGrid::CellCoordinate > *preimage) | |
Public Attributes | |
int | cardinality |
EntryCoordinate | entry_index |
std::vector< typename UniformGrid::CellCoordinate > * | pre_image |
This class represents the pre-image for a given entry in the offset table, that is the set
Definition at line 677 of file perfect_spatial_hashing.h.
vcg::PerfectSpatialHashing< OBJECT_TYPE, SCALAR_TYPE >::OffsetTable::PreImage::PreImage | ( | EntryCoordinate & | at, | |
std::vector< typename UniformGrid::CellCoordinate > * | preimage | |||
) | [inline] |
Default constructor.
[in] | at | The entry in the offset table where the cells in the preimage are mapped into. |
[in] | preimage | The set of UniformGrid cells mapping to this entry. |
Definition at line 684 of file perfect_spatial_hashing.h.
bool vcg::PerfectSpatialHashing< OBJECT_TYPE, SCALAR_TYPE >::OffsetTable::PreImage::operator< | ( | const PreImage & | second | ) | const [inline] |
less-than operator: needed for sorting the preimage slots based on their cardinality.
second |
true
if and only if the cardinality of this preimage slot is greater than that of second
. Definition at line 696 of file perfect_spatial_hashing.h.
int vcg::PerfectSpatialHashing< OBJECT_TYPE, SCALAR_TYPE >::OffsetTable::PreImage::cardinality |
The cardinality of the pre-image.
Definition at line 702 of file perfect_spatial_hashing.h.
EntryCoordinate vcg::PerfectSpatialHashing< OBJECT_TYPE, SCALAR_TYPE >::OffsetTable::PreImage::entry_index |
The index of the entry inside the offset table.
Definition at line 701 of file perfect_spatial_hashing.h.
std::vector< typename UniformGrid::CellCoordinate >* vcg::PerfectSpatialHashing< OBJECT_TYPE, SCALAR_TYPE >::OffsetTable::PreImage::pre_image |
The set of entries in the uniform grid whose image through is this entry.
Definition at line 700 of file perfect_spatial_hashing.h.