\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.11 - Triangulated Surface Mesh Shortest Paths
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Todo List
Group PkgSurfaceMeshShortestPath

Modify the algorithm to support more efficient incremental construction

Add parallelization to the algorithm

Add methods for computing the ridge tree using the output of the algorithm

Add methods for computing shortest paths from geodesic sources as well

page User Manual
add an example using the AABB-tree