Digital Library (University of West Bohemia) · 2002 · 47 citations · 9 references
Open access
ComputingComputer ScienceMathematicsComputational GeometryGeometric ModelingGeometryGeometric ApproximationGeometry ProcessingMesh AnalysisMesh GenerationMesh ModelingMesh ProcessingDijkstra's AlgorithmEikonal EquationMesh ApproximationMesh TriangulationTriangle Mesh ProcessingTriangulation Algorithms
We present an approximation method to compute geodesic distances on triangulated domains in the three dimensional space. Our particular approach is based on the Fast Marching Method for solving the Eikonal equation on triangular meshes. As such, the algorithm is a wavefront propagation method, a reminiscent of the Dijkstra algorithm, which runs in O(n log n) steps.
9
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Topology matching for fully automatic similarity estimation of 3D shapes
Masaki Hilaga, Yoshihisa Shinagawa, Taku Kohmura et al. · 2001 · 2.2K citations
Computing geodesic paths on manifolds
Ron Kimmel, James A. Sethian · Proceedings of the National Academy of Sciences · 1998 · 1.1K citations
Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou · SIAM Journal on Computing · 1987 · 722 citations
New lower bound techniques for robot motion planning problems
John Canny, John H. Reif · 1987 · 544 citations