Hash function in computer graphics

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00073917" target="_blank" >RIV/49777513:23520/02:00073917 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Hash function in computer graphics
Original language description
An algorithm complexity is a very crucial issue in the algorithm design, especially if large data sets are to be processed. Data search is very often used in many algorithms and hash function use gives us a possibility to speed up the process significantly. Nevertheles, it is very difficult do design a good hash function expecially for geometric applications. This paper describes a new hash function, its behaviour and use for non-trivial problems. Some problems can be solved effectively using the principle of duality and the hash data structure. Also some problems that cannot be solved in Euclidean space can be solved if dual representation is used and some examples are presented, too.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JC - Computer hardware and software
OECD FORD branch
—

Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical
Proceedings from the first Seminar on Computer Graphics and Visualization
ISSN
14038757
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
Č. 19
Country of publishing house
SE - SWEDEN
Number of pages
9
Pages from-to
120
UT code for WoS article
—
EID of the result in the Scopus database
—

Similar results(10)