diff options
| author | Erik Abrahamsson <ecke101@gmail.com> | 2021-07-06 01:09:36 +0300 |
|---|---|---|
| committer | Howard Trickey <howard.trickey@gmail.com> | 2021-07-06 01:09:36 +0300 |
| commit | ceff86aafe46a6fb66e023500f5a47260964b0a2 (patch) | |
| tree | a34e6772226719f0f22806f475cdb07bfbf458c7 /source/blender/blenlib/BLI_mesh_intersect.hh | |
| parent | cf17f7e0cc6efb6f14a271e37d2ea1b3f10bb66d (diff) | |
Various Exact Boolean parallelizations and optimizations.
From patch D11780 from Erik Abrahamsson.
It parallelizes making the vertices, destruction of map entries,
finding if the result is PWN, finding triangle adjacencies,
and finding the ambient cell.
The latter needs a parallel_reduce from tbb, so added one into
BLI_task.hh so that if WITH_TBB is false, the code will still work.
On Erik's 6-core machine, the elapsed time went from 17.5s to 11.8s
(33% faster) on an intersection of two spheres with 3.1M faces.
On Howard's 24-core machine, the elapsed time went from 18.7s to 10.8s
for the same test.
Diffstat (limited to 'source/blender/blenlib/BLI_mesh_intersect.hh')
| -rw-r--r-- | source/blender/blenlib/BLI_mesh_intersect.hh | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/source/blender/blenlib/BLI_mesh_intersect.hh b/source/blender/blenlib/BLI_mesh_intersect.hh index a19682327a5..f28be9bf59b 100644 --- a/source/blender/blenlib/BLI_mesh_intersect.hh +++ b/source/blender/blenlib/BLI_mesh_intersect.hh @@ -225,6 +225,7 @@ class IMeshArena : NonCopyable, NonMovable { */ const Vert *add_or_find_vert(const mpq3 &co, int orig); const Vert *add_or_find_vert(const double3 &co, int orig); + const Vert *add_or_find_vert(Vert *vert); Face *add_face(Span<const Vert *> verts, int orig, |