TTK
Loading...
Searching...
No Matches
Laplacian.h
Go to the documentation of this file.
1#pragma once
2
3#include <Triangulation.h>
4
5namespace ttk {
6 namespace Laplacian {
7
11 inline void
13 triangulation.preconditionVertexNeighbors();
14 triangulation.preconditionVertexEdges();
15 triangulation.preconditionTriangles();
16 triangulation.preconditionEdgeTriangles();
17 }
18
29 template <typename T,
30 class TriangulationType = AbstractTriangulation,
31 typename SparseMatrixType>
32 int discreteLaplacian(SparseMatrixType &output,
33 const Debug &dbg,
34 const TriangulationType &triangulation);
35
47 template <typename T,
48 class TriangulationType = AbstractTriangulation,
49 typename SparseMatrixType>
50 int cotanWeights(SparseMatrixType &output,
51 const Debug &dbg,
52 const TriangulationType &triangulation);
53
54 } // namespace Laplacian
55} // namespace ttk
AbstractTriangulation is an interface class that defines an interface for efficient traversal methods...
Minimalist debugging class.
Definition Debug.h:88
int discreteLaplacian(SparseMatrixType &output, const Debug &dbg, const TriangulationType &triangulation)
Compute the Laplacian matrix of the graph.
void preconditionTriangulation(AbstractTriangulation &triangulation)
Triangulation precondition function.
Definition Laplacian.h:12
int cotanWeights(SparseMatrixType &output, const Debug &dbg, const TriangulationType &triangulation)
Compute the Laplacian matrix of the graph using the cotangente weights method.
The Topology ToolKit.