songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Make iDT the default and explain O() complexity

This commit is contained in:
Andreas Fabri 2018-11-20 18:42:23 +01:00
parent d749d3f003
commit 9546044462
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
View File

@ -216,7 +216,7 @@ The algorithm is as follows:
The time complexity of the algorithm is determined primarily by the The time complexity of the algorithm is determined primarily by the
choice of linear solver. In the current implementation, Cholesky choice of linear solver. In the current implementation, Cholesky
prefactorization is roughly \f$ O(N^1.5)\f$ and evaluation of distance is prefactorization is roughly \f$ O(N^{1.5})\f$ and evaluation of distance is
roughly \f$ O(N)\f$, where \f$ N\f$ is the number of vertices in the triangulation. roughly \f$ O(N)\f$, where \f$ N\f$ is the number of vertices in the triangulation.
The algorithm uses two \f$ N \times N\f$ matrices, both with the same pattern of The algorithm uses two \f$ N \times N\f$ matrices, both with the same pattern of
nonzeros as the graph Laplacian of the edge graph (roughly 7 nonzeros nonzeros as the graph Laplacian of the edge graph (roughly 7 nonzeros