Paper Title
Data Store and Search of Hash Table for Level Set Method

Abstract
It is important to use an efficient data structure in the area to deal with a great of data. In this paper, first, we have designed and implemented a hash table for narrow band level set method, and store a large geometry modeling data in it. In succession, we checked the search time of the hash table according to the size of the hash table and the interface moving. Finally, we show that the search time of the modeling objects in the hash table decreases as the hash size increase, and that the search time of the modeling objects in the moving step is smaller than the update time in the initialization step. Index Terms - Level set method, hash table, Interface moving