Revision as of 03:53, 22 May 2018 edit Jarble (talk \| contribs) Autopatrolled, Extended confirmed users 150,084 edits adding links to references using Google Scholar ← Previous edit		Revision as of 18:30, 18 November 2018 edit undo Colonies Chris (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 446,973 edits →Chronological developments Next edit →
Line 4: ==Chronological developments== The powerful [[level -set method]] is due to [[Stanley Osher\|Osher]] and [[James Sethian\|Sethian]] 1988.<ref name=Osher>Osher, S. & Sethian, J. A. 1988. "Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations". ''Journal of Computation Physics'' 79:12–49.</ref> However, the straightforward implementation via a dense d-dimensional [[array data structure\|array]] of values, results in both time and storage complexity of <math>O(n^d)</math>, where <math>n</math> is the cross sectional resolution of the spatial extents of the ___domain and <math>d</math> is the number of spatial dimensions of the ___domain.

Level set (data structures): Difference between revisions