mirror of https://github.com/CGAL/cgal
51 lines
1.4 KiB
Plaintext
51 lines
1.4 KiB
Plaintext
// The Heat Method
|
|
|
|
/// \defgroup PkgHeatMethod Heat Method Reference
|
|
|
|
/// \defgroup PkgHeatMethodConcepts Concepts
|
|
/// \ingroup PkgHeatMethod
|
|
|
|
|
|
/*!
|
|
\addtogroup PkgHeatMethod
|
|
|
|
\cgalPkgDescriptionBegin{The Heat Method,PkgHeatMethodSummary}
|
|
\cgalPkgPicture{heat-method-small.png}
|
|
|
|
\cgalPkgSummaryBegin
|
|
\cgalPkgAuthors{Keenan Crane, Christina Vaz, Andreas Fabri}
|
|
\cgalPkgDesc{The package provides an algorithm that solves the single- or
|
|
multiple-source shortest path problem by returning the geodesic distance
|
|
for all vertices of a triangle mesh to the closest vertex in a given set of
|
|
source vertices. }
|
|
\cgalPkgManuals{Chapter_HeatMethod,PkgHeatMethod}
|
|
\cgalPkgSummaryEnd
|
|
\cgalPkgShortInfoBegin
|
|
\cgalPkgSince{4.14}
|
|
\cgalPkgDependsOn{ \ref PkgSolverSummary; <a href="https://doc.cgal.org/latest/Manual/installation.html#thirdpartyEigen">Eigen</a>}
|
|
\cgalPkgBib{cgal:cvf-hm3}
|
|
\cgalPkgLicense{\ref licensesGPL "GPL"}
|
|
\cgalPkgDemo{Polyhedron demo,polyhedron_3.zip}
|
|
\cgalPkgShortInfoEnd
|
|
|
|
\cgalPkgDescriptionEnd
|
|
|
|
\cgalClassifedRefPages
|
|
|
|
## Concepts ##
|
|
- `HeatMethodTraits_3`
|
|
|
|
## Classes ##
|
|
- `CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3`
|
|
- `CGAL::Heat_method_3::Direct`
|
|
- `CGAL::Heat_method_3::Intrinsic_Delaunay`
|
|
|
|
## Functions ##
|
|
|
|
- `CGAL::Heat_method_3::estimate_geodesic_distances()`
|
|
|
|
*/
|
|
\todo Add more detailed cache
|
|
\todo Add Neumann and Dirichlet boundary conditions
|
|
\todo Check if suitesparse is more efficient than eigen
|