CGAL 4.7 - Triangulated Surface Mesh Shortest Paths: Triangulated Surface Mesh Geodesic Shortest Paths Reference

\( \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.7 - 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

##

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-15b
License: GPL
Windows Demo: Operations on Polyhedra
Common Demo Dlls: dlls

## Classified Reference Pages

## Concepts

- `SurfaceMeshShortestPathTraits`
- `SurfaceMeshShortestPathVisitor`

## Classes

- `CGAL::Surface_mesh_shortest_path<SurfaceMeshShortestPathTraits,VertexIndexMap, HalfedgeIndexMap, FaceIndexMap, VertexPointMap>`
- `CGAL::Surface_mesh_shortest_path_traits<Kernel, FaceListGraph>`

## Enums

- `CGAL::Surface_mesh_shortest_paths_3::Barycentric_coordinate_type`

## 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...