SIAM Journal on Computing
Shortest paths on a polyhedron
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast exact and approximate geodesics on meshes
ACM SIGGRAPH 2005 Papers
Geodesic Bézier curves on triangle meshes
ACM SIGGRAPH 2006 Research posters
Subdivision Curves on Surfaces and Applications
CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
Improving Chen and Han's algorithm on the discrete geodesic problem
ACM Transactions on Graphics (TOG)
Geodesic-like curves on parametric surfaces
Computer Aided Geometric Design
Real-time multi-agent path planning on arbitrary surfaces
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
A note of boundary geodesic problem on regular surfaces
ECC'11 Proceedings of the 5th European conference on European computing conference
The general orthogonal projection on a regular surface
ECC'11 Proceedings of the 5th European conference on European computing conference
A survey of geodesic paths on 3D surfaces
Computational Geometry: Theory and Applications
Fast adaptive blue noise on polygonal surfaces
Graphical Models
| Hi-index | 0.00 |
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on 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 both convex and non-convex surfaces.