|
User Documentation |
|
Centre for Vision, Speech & Signal Processing |
Comments:
typedef StackG< t_hash3d_data > t_hash3d_list;
typedef StackIterG< t_hash3d_data > t_hash3d_iter;
========================================================
Constructs a hash table of points in 3D space
using a voxel subdivision of 3D space to generate key
The size of the hash table is a prime number greater than
the number of points to be inserted in the table.
Hash table: contains a list of `references' to points with
the same hash index.
Reference: a unique reference for each point
should is passed to the table on insertion.
Variables:
Methods:
- Hash3dC()
-
construct empty hash table
cannot be accessed
- Hash3dC(const IntT num,const Vector3dC vsize)
-
Construct an empty hash table
number of slots >= num
with table bins corresponding to the voxel size 'vsize'
- Hash3dC(const IntT num,const RealT size)
-
Construct an empty hash table
number of slots >= num
with table bins corresponding to the uniform voxel size 'size'
- Hash3dC(VectorSetC & vset,Vector3dC & vsize)
-
Construct hash table for vector set 'vset'
with table bins corresponding to the voxel size 'vsize'
- Hash3dC(VectorSetC & vset,RealT & size)
-
- ~Hash3dC()
-
- const Hash3dC & operator=(const Hash3dC & hash)
-
Access
-------
- IntT Size()
-
size of hash table
- Vector3dC VoxelSize()
-
size of hash table voxels
- void Put(const IntT ref,Vector3dC & v)
-
put a point 'v' into the hash table with reference 'ref'
- t_hash3d_list & Get(const Vector3dC v)
-
return a list of table entries with same key as v
- t_hash3d_list & GetAdj(const Vector3dC v,const IntT ii,const IntT jj,const IntT kk)
-
return a list of table entries corresponding to offset of voxel v
v => voxel (i,j,k) then above => voxel(i+ii,j+jj,k+kk)
allows search of points in neighbouring voxels
Output
------
- void Print()
-
contents of non-empty table bins
|
Programmer:Adrian Hilton, Documentation by CxxDoc: Tue Mar 20 10:48:08 2001
|