Content deleted Content added
m Changed link again to a more related subpage |
Added concluding remarks from the paper |
||
Line 24:
===Hash Table Local Level Set===
The Hash Table Local Level Set method, introduced in 2012 by Brun, Guittet and Gibou,<ref name=BrunGuittetGibou>Brun, E., Guittet, A. & Gibou, F. 2012. "A local level-set method using a hash table data structure." ''[[Journal of Computational Physics]]''. 231(6)2528-2536.</ref> only computes the level set data in a band around the interface, as in the Narrow Band Level-Set Method, but also only stores the data in that same band. A hash table data structure is used, which provides an <math>O(1)</math> access to the data. However, the authors conclude that their method, while being easier to implement, performs worse than a quadtree implementation. They find that {{quote|as it is, [...] a quadtree data structure seems more adapted than the hash table data structure for level-set algorithms.}} Three main reasons for worse efficiency are listed:
{{{quote|
# to obtain accurate results, a rather large band is required close to the interface, which counterbalances the absence of grid nodes far from the interface;
# the performances are deteriorated by extrapolation procedures on the outer edges of the local grid and
# the width of the band restricts the time step and slows down the method.
}}}
===Point-based===
| |||