Title: | Parallel Triangular Mesh Reduction |
Authors: | Franc, Martin Skala, Václav |
Citation: | ALGORITMY 2000: 15th Conference on Scientific Computing, p. 357-367. |
Issue Date: | 2000 |
Publisher: | Slovenská technická univerzita |
Document type: | konferenční příspěvek conferenceObject |
URI: | http://hdl.handle.net/11025/11725 |
ISBN: | 80-227-1391-0 |
Keywords: | vizualizace dat;redukce trojúhelníkových mřížek;komplexita algoritmů;počítačová grafika;paralelní programování |
Keywords in different language: | data visualization;triangular mesh reduction;algorithm complexity;computer graphics;parallel programming |
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. |
Appears in Collections: | Konferenční příspěvky / Conference Papers (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2000_Mesh-Reduction-Algoritmy.pdf | Plný text | 287,25 kB | Adobe PDF | View/Open Request a copy |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11725
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.