@@ -329,7 +329,7 @@ The current implementation of choosing the candidate point inside a simplex (tri
The choice depends on the shape of the simplex, where the algorithm tries to create regular simplices.
Alternatively, a good strategy is choosing points somewhere on the edge of a triangle such that the simplex aligns with the gradient of the function; creating an anisotropic triangulation[@dyn1990data].
This is a similar approach to the anisotropic meshing techniques mentioned in the literature review.
We have started to implement this, however, there are still some unsolved problems.
We have started to implement this feature in Adaptive, however, there are still some unsolved problems.
#### Learning stochastic functions is a promising direction.
