diff options
Diffstat (limited to 'source/blender/blenlib/intern/BLI_kdopbvh.c')
| -rw-r--r-- | source/blender/blenlib/intern/BLI_kdopbvh.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c index 1c0bac4a82f..1876a625bc3 100644 --- a/source/blender/blenlib/intern/BLI_kdopbvh.c +++ b/source/blender/blenlib/intern/BLI_kdopbvh.c @@ -719,7 +719,7 @@ static void split_leafs(BVHNode **leafs_array, int *nth, int partitions, int spl * This function creates an implicit tree on branches_array, the leafs are given on the leafs_array. * * The tree is built per depth levels. First branchs at depth 1.. then branches at depth 2.. etc.. - * The reason is that we can build level N+1 from level N witouth any data dependencies.. thus it allows + * The reason is that we can build level N+1 from level N without any data dependencies.. thus it allows * to use multithread building. * * To archieve this is necessary to find how much leafs are accessible from a certain branch, BVHBuildHelper @@ -1501,7 +1501,7 @@ static void dfs_raycast(BVHRayCastData *data, BVHNode *node) //ray-bv is really fast.. and simple tests revealed its worth to test it //before calling the ray-primitive functions - /* XXX: temporary solution for particles untill fast_ray_nearest_hit supports ray.radius */ + /* XXX: temporary solution for particles until fast_ray_nearest_hit supports ray.radius */ float dist = (data->ray.radius > 0.0f) ? ray_nearest_hit(data, node->bv) : fast_ray_nearest_hit(data, node); if(dist >= data->hit.dist) return; |