A carregar...

Computing geodesic paths on manifolds

The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. As an...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Kimmel, R., Sethian, J. A.
Formato: Artigo
Idioma:Inglês
Publicado em: The National Academy of Sciences 1998
Assuntos:
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC21092/
https://ncbi.nlm.nih.gov/pubmed/9671694
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!