aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorsotech117 <michael_foiani@brown.edu>2024-04-05 23:36:16 -0400
committersotech117 <michael_foiani@brown.edu>2024-04-05 23:36:16 -0400
commit4603c1672a97753c728e087d85db5f79c8884fe2 (patch)
tree09ccf5a957aa51dad3690e9951c73f5489979062 /README.md
parentccf589b32531e5999887bec950c0f38bf9e1d893 (diff)
improve performance and udpate some videos
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index c637b9a..8642ed7 100644
--- a/README.md
+++ b/README.md
@@ -90,7 +90,7 @@ For this project, we ask that you demonstrate to us that your program achieves t
### Extra Feature: Parallelization
For the solving algorithm, I divided the dimensions and parallelized my code using the QTFramework to concurrently calculate the estimated positions.
-See line 280 in arap.c for the implementation.
+See line 286 in arap.c for the implementation.
The video below shows both implementations (concurrent and normal) when deforming bunny.obj, a large mesh, at 1000 iterations.
It appears the concurrent implementation is faster by only about a second.