Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Franc, Martin | |
dc.contributor.author | Skala, Václav | |
dc.date.accessioned | 2014-09-15T11:38:22Z | |
dc.date.available | 2014-09-15T11:38:22Z | |
dc.date.issued | 2000 | |
dc.identifier.citation | ALGORITMY 2000: 15th Conference on Scientific Computing, p. 357-367. | en |
dc.identifier.isbn | 80-227-1391-0 | |
dc.identifier.uri | http://hdl.handle.net/11025/11725 | |
dc.description.abstract | There are many applications where data structures use a hash function. The hash data structures are widely used across all fields of computer science. Nevertheless the design or selection of hash function for data sets with unknown properties is a problem. The Rapid Prototyping uses STL format, where a set of triangles is used to represent a surfwe of the object. It is necessary to construct the regular triangular mesh from the STL data format for many applications. It is a lengthy process for large data sets as the time complexity of this process is O(N2) or 0(N 1g19 , where N is a number of triangles. The hash table can be used to speed up the process but the speed strongly depends on hash function properties. This per describes a new hash function and presents properties obtained on large data sets. Keywords: data visualization, hash function, algorithm complexity, computer graphics, triangular mesh, STL format. | en |
dc.format | 11 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Slovenská technická univerzita | cs |
dc.relation.ispartofseries | ALGORITMY 2000: 15th Conference on Scientific Computing | en |
dc.subject | vizualizace dat | cs |
dc.subject | redukce trojúhelníkových mřížek | cs |
dc.subject | komplexita algoritmů | cs |
dc.subject | počítačová grafika | cs |
dc.subject | paralelní programování | cs |
dc.title | Parallel Triangular Mesh Reduction | 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 | data visualization | en |
dc.subject.translated | triangular mesh reduction | en |
dc.subject.translated | algorithm complexity | en |
dc.subject.translated | computer graphics | en |
dc.subject.translated | parallel programming | 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 | |
---|---|---|---|---|
2000_Mesh-Reduction-Algoritmy.pdf | Plný text | 287,25 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/11725
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.