Share Email Print
cover

Proceedings Paper

Hash function use for triangular mesh reconstruction
Author(s): Vaclav Skala
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 31 July 2002
PDF: 8 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477173
Show Author Affiliations
Vaclav Skala, Univ. of West Bohemia (Czech Republic)


Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics

© SPIE. Terms of Use
Back to Top