Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Skala, Václav | |
dc.date.accessioned | 2015-01-05T12:57:48Z | - |
dc.date.available | 2015-01-05T12:57:48Z | - |
dc.date.issued | 2002 | |
dc.identifier.citation | Proceedings from the first Seminar on Computer Graphics and Visualization, p. 120-128. | cs |
dc.identifier.issn | 1403-8757 | |
dc.identifier.uri | http://hdl.handle.net/11025/11800 | |
dc.description.abstract | 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. Nevertheless, it is very difficult do design a good hash function especially 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. | en |
dc.format | 8 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.relation.ispartofseries | Proceedings from the first Seminar on Computer Graphics and Visualization | en |
dc.subject | hešovací funkce | cs |
dc.subject | vizualizace | cs |
dc.subject | počítačová grafika | cs |
dc.title | Hash Function in Computer Graphics | en |
dc.type | konferenční příspěvek | cs |
dc.type | conferenceObject | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.subject.translated | hash function | en |
dc.subject.translated | visualization | en |
dc.subject.translated | computer graphics | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Konferenční příspěvky / Conference Papers (KIV) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Skala_2002_Hash_Gavle.pdf | Plný text | 634,64 kB | Adobe PDF | Zobrazit/otevřít Vyžádat kopii |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/11800
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.