Hash function for triangular mesh reconstruction

  • Authors:

  • Václav Skala;Jan Hrádek;Martin Kuchař

  • Affiliations:

  • Department of Computer Science and Engineering, University of West Bohemia, Plzeň, Czech Republic;Department of Computer Science and Engineering, University of West Bohemia, Plzeň, Czech Republic;Department of Computer Science and Engineering, University of West Bohemia, Plzeň, Czech Republic

  • Venue:
  • ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.