Name
Abstract | ||
|---|---|---|
We present a new algorithm to compute a geodesic path over a triangulated surface. Based in Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and non-convex surfaces as well. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/SIBGRA.2004.1352963 | SIBGRAPI |
Keywords | Field | DocType |
iterative process,triangulated surface,geodesic path,straightest geodesics theory,good discrete geodesic approximation,fast marching method,new algorithm,non-convex surface,triangular meshes,geodesic paths,iterative methods,triangular mesh,data visualisation,differential geometry,fast marching,computational geometry | Topology,Polygon mesh,Mathematical analysis,Fast marching method,Iterative method,Computational geometry,Solving the geodesic equations,Regular polygon,Differential geometry,Mathematics,Geodesic | Conference |
ISBN | Citations | PageRank |
0-7695-2227-0 | 14 | 0.96 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimas Martínez | 1 | 95 | 5.90 |
| Luiz Velho | 2 | 1162 | 120.74 |
| Paulo Cezar Carvalho | 3 | 46 | 4.17 |