aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
Diffstat (limited to 'README.md')
-rw-r--r--README.md11
1 files changed, 8 insertions, 3 deletions
diff --git a/README.md b/README.md
index 8642ed7..8f1fb63 100644
--- a/README.md
+++ b/README.md
@@ -92,9 +92,14 @@ For this project, we ask that you demonstrate to us that your program achieves t
For the solving algorithm, I divided the dimensions and parallelized my code using the QTFramework to concurrently calculate the estimated positions.
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.
+For this case, it appears the concurrent implementation is faster by 2 seconds (9sec vs 11sec).
| Program Specification | Video |
|:------------------------------------------------------------------|:------------------------------------|
-| Modifying Peter at 1000 iterations with no concurrent framework. | ![](./readme-videos/bunny-conc.gif) |
-| Modifying Peter at 1000 iterations using QTConcurrent map-reduce. | ![](./readme-videos/bunny-norm.gif) |
+| Modifying Bunny at 1000 iterations with no concurrent framework. | ![](./readme-videos/bunny-conc.gif) |
+| Modifying Bunny at 1000 iterations using QTConcurrent map-reduce. | ![](./readme-videos/bunny-norm.gif) |
+
+### 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