\( \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
Modules | Files | Classes
Triangulated Surface Mesh Geodesic Shortest Paths Reference

Todo:

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

shortestpathspackage-ico.png
Stephen Kiazyk, Sébastien Loriot, Éric Colin de Verdière
The package provides methods for computing geodesic shortest path on triangulated surface meshes. The algorithm used is based on a paper by Xin and Wang [3] . The input of this package can be any model of the FaceListGraph concept.


Introduced in: CGAL 4.7
BibTeX: cgal:klcdv-tsmsp-17b
License: GPL
Windows Demo: Polyhedron demo
Common Demo Dlls: dlls

Classified Reference Pages

Concepts

Classes

Enums

Modules

 Concepts
 
 Traits Classes
 

Files

file  Surface_mesh_shortest_path.h
 Convenience header file only including CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h and CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h.
 

Classes

class  CGAL::Surface_mesh_shortest_path< Traits, VIM, HIM, FIM, VPM >
 Computes shortest surface paths from one or more source points on a surface mesh. More...