ccd8926717
Replaces current basis function calculation which seems to be a direct implementation of the recursive NURBS formulation. New implementation avoids the need to check for zero divisions during iteration. Out of bounds checks are also converted to asserts, assuming input provides valid span index. Performance wise this nets a 7+% performance improvement with the average result being as fast or faster then the fastest execution from previous implementation! Pull Request: https://projects.blender.org/blender/blender/pulls/144457
4 lines
131 B
Plaintext
4 lines
131 B
Plaintext
version https://git-lfs.github.com/spec/v1
|
|
oid sha256:be868ba16e2354f06d4aeec4e53abb27cefbf3ad5a45e57215d21b2ed989abb9
|
|
size 321069
|