From 04e09f45cac1cb8ff7eb3784ccb9e22c37f81fe5 Mon Sep 17 00:00:00 2001
From: sotech117 <26747948+sotech117@users.noreply.github.com>
Date: Fri, 5 Apr 2024 23:47:06 -0400
Subject: Update README.md

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 05e8035..394297c 100644
--- a/README.md
+++ b/README.md
@@ -15,8 +15,8 @@ Use an integer for the num iterations and a string to the path for the mesh.
 2. _Briefly_, all the features your code implements, including any known bugs.
 
 I implemented the basics of arap under the move() function. The order of the overall implementation is as follows:
+- Estimate pprime from p.
 - When the number of anchors changes:
-  - Estimate pprime from p.
   - Compute the cotan weights.
   - Define the constraints map.
   - Compute the L matrix.
@@ -57,4 +57,4 @@ For this case, it appears the concurrent implementation is faster by 2 seconds (
 ### Citations/references
 - https://igl.ethz.ch/projects/deformation-survey/deformation_survey.pdf for how to handle deformed triangles
 - https://github.com/cheind for how to create a space matrix efficiently using triplets 
-- github co-pilot was enabled in my clion ide for code suggestions
\ No newline at end of file
+- github co-pilot was enabled in my clion ide for code suggestions
-- 
cgit v1.2.3-70-g09d2