Cargando…
Fast marching methods for computing distance maps shortest paths
Autores principales: | Kimmel, R, Sethian, J A |
---|---|
Lenguaje: | eng |
Publicado: |
1996
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/303038 |
Ejemplares similares
-
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
Shortest paths for sub-Riemannian metrics on rank-two distributions
por: Liu, Wensheng, et al.
Publicado: (1995) -
Shortest Connectivity: An Introduction with Applications in Phylogeny
por: Cieslik, Dietmar
Publicado: (2005) -
On the shortest path problem of uncertain random digraphs
por: Li, Hao, et al.
Publicado: (2022) -
A unified framework for shape segmentation, representation, and recognition
por: Malladi, R, et al.
Publicado: (1994)