Title: Hash Function for Triangular Mesh Reconstruction
Authors: Skala, Václav
Hrádek, Jan
Kuchař, Martin
Citation: Recent Advances in Computers: Proceedings of the 13th WSEAS International Conference on Computers, p. 233-238.
Issue Date: 2009
Publisher: WSEAS
Document type: preprint
URI: http://hdl.handle.net/11025/11343
ISBN: 978-960-474-099-4
Keywords: počítačová grafika;trohúhelníkové sítě;hešovací funkce
Keywords in different language: computer graphics;triangular meshes;hash function
Abstract: Some applications use data formats (for example STL file format), where a set of triangles is used to represent a surface of an object and it is necessary to reconstruct the regular triangular mesh from such a 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 O(N lgN), where N is a number of triangles. Hash data structures are widely used all over the fields of computer science. The hash table can be used to speed up the process of triangular mesh reconstruction but the speed strongly depends on hash function properties. Nevertheless the design or selection of the hash function for data sets with unknown properties is a problem. This paper describes a new hash function and presents properties obtained from large data sets.
Rights: Original article published under copyright license: © 2009 WSEAS
Appears in Collections:Preprinty / Preprints (KIV)

Files in This Item:
File Description SizeFormat 
Skala_2009_Hash-Rodos.pdfPlný text494,18 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11343

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.