Principles of data structures and algorithms with Pascal
Principles of data structures and algorithms with Pascal
Building vertex normals from an unstructured polygon list
Graphics gems IV
Principles of hash-based text retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
A 3D-Hash Function for Fast Image Indexing and Retrieval
CGIV '07 Proceedings of the Computer Graphics, Imaging and Visualisation
| Hi-index | 0.00 |
Techniques based on hashing are heavily used in many applications, e.g. information retrieval, geometry processing, chemical and medical applications etc. and even in cryptography. Traditionally the hash functions are considered in a form of h(v) = f(v) mod m, where m is considered as a prime number and f(v) is a function over the element v, which is generally of "unlimited" dimensionality and/or of "unlimited" range of values. In this paper a new approach for a hash function construction is presented which offers unique properties for textual and geometric data. Textual data have a limited range of values (the alphabet size) and "unlimited" dimensionality (the string length), while geometric data have "unlimited" range of values (usually (-∞, ∞)), but limited dimensionality (usually 2 or 3). Construction of the hash function differs for textual and geometric data and the proposed hash construction has been verified on non-trivial data sets.