Can I read Steepest Descent Paths on Simplicial Meshes on EtoBox?
Steepest Descent Paths on Simplicial Meshes by Leandro Gilas is a document available to read on EtoBox.
What is Steepest Descent Paths on Simplicial Meshes about?
This paper introduces an algorithm to compute steepest descent paths on multivariate piecewise-linear functions defined on simplicial complexes of arbitrary dimension. Existing approaches for 2D and 3D define case-by-case procedures that do not generalize to higher dimensions. The presented algorithm derives the analytical form of the hyperplane containing each simplex independently of its dimension, allowing computation of steepest descent paths in any dimension. The algorithm efficiently handles cases of
- Author
- Leandro Gilas
- Language
- EN