A Fast-marching Algorithm for Nonmonotonically Evolving Fronts

@article{Tcheng2016AFA,
  title={A Fast-marching Algorithm for Nonmonotonically Evolving Fronts},
  author={Alexandra Tcheng and Jean-Christophe Nave},
  journal={SIAM J. Scientific Computing},
  year={2016},
  volume={38}
}
The non-monotonic propagation of fronts is considered. When the speed function F : Rn × [0, T ]→ R is prescribed, the non-linear advection equation φt + F |∇φ| = 0 is a HamiltonJacobi equation known as the level-set equation. It is argued that a small enough neighbourhood of the zero-level-setM of the solution φ : Rn × [0, T ]→ R is the graph of ψ : Rn → R where ψ solves a Dirichlet problem of the form H(u, ψ(u),∇ψ(u)) = 0. A fast-marching algorithm is presented where each point is computed… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 37 REFERENCES

A fast marching level set method for monotonically advancing fronts.

  • Proceedings of the National Academy of Sciences of the United States of America
  • 1996
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Fast marching algorithms for non-monotonically evolving fronts

Alexandra Tcheng
  • PhD thesis, McGill University,
  • 2015

Froese and Adam M . Oberman . Convergent filtered schemes for the monge – ampre partial differential equation

X. L. Li, D. C. Tan
  • SIAM Journal on Numerical Analysis
  • 2013