From edf6cb236cc80b3db48bc0207d9c7b299dd3f3c9 Mon Sep 17 00:00:00 2001 From: Taylor Holliday Date: Sat, 5 Oct 2024 20:42:06 -0700 Subject: [PATCH] add missing word --- docs/tutorial.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/tutorial.md b/docs/tutorial.md index cb7d3716a..e67724021 100644 --- a/docs/tutorial.md +++ b/docs/tutorial.md @@ -882,7 +882,7 @@ for(int i : vertices) } ``` -Similarly as before, it may seem to loop over one-rings without having an half-edge data structure. However, this is not the case, since the Laplacian may be built by summing together contributions for each triangle, much in spirit with its FEM discretization +Similarly as before, it may seem inefficient to loop over one-rings without having an half-edge data structure. However, this is not the case, since the Laplacian may be built by summing together contributions for each triangle, much in spirit with its FEM discretization of the Dirichlet energy (sum of squared gradients): ```cpp