diff options
| author | sotech117 <26747948+sotech117@users.noreply.github.com> | 2024-04-05 23:47:06 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-04-05 23:47:06 -0400 |
| commit | 04e09f45cac1cb8ff7eb3784ccb9e22c37f81fe5 (patch) | |
| tree | 2b9015cf50472e30d0bb5536cb0a1613731f328e | |
| parent | 82822c228977aae88aec89061c9140fd76135581 (diff) | |
Update README.md
| -rw-r--r-- | README.md | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -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 |