aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'README.md')
-rw-r--r--README.md4
1 files 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