From c0879e56d79c825436712157c15a16e5f98255dd Mon Sep 17 00:00:00 2001
From: Johannes Markert <10619309+jmark@users.noreply.github.com>
Date: Fri, 10 May 2024 11:17:52 +0200
Subject: [PATCH] Update paper.md

Co-authored-by: Sandro Elsweijer <49643115+sandro-elsweijer@users.noreply.github.com>
---
 paper.md | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/paper.md b/paper.md
index e73997d..de325dc 100644
--- a/paper.md
+++ b/paper.md
@@ -129,13 +129,14 @@ stores only a minimal amount of information about the finest elements of the mes
 the leaves of the trees - in order to reconstruct the whole forest.
 
 By enumerating the leaves in a recursive refinement pattern we obtain a
-space-filling curve (SFC) logic. Via these SFCs, all elements in a refinement
+space-filling curve (SFC) logic. Via these SFC, all elements in a refinement
 tree are assigned an index and are stored in the linear order of these indices.
 Information such as coordinates or element neighbors do not need to be stored
 explicitly but can be deducted from the index and the appropriate information
-of the coarse mesh. The forest mesh can be distributed across multiple
-processes, so that each one only stores a unique portion of the forest mesh.
-See \autoref{fig:SpaceFillingCurves}.
+of the coarse mesh. Fast bitwise and integer-based SFC operations ensure optimal
+runtimes and diminish the need of memory lookups. Moreover, the SFC is used to
+distribute the forest mesh across multiple processes, so that each one only stores
+a unique portion of the forest mesh. See \autoref{fig:SpaceFillingCurves}.
 
 While being successfully applied to quadrilateral
 and hexahedral meshes [@burstedde_p4est_2011; @weinzierl_peano_2019],