diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2017-10-22 17:15:26 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2017-10-22 17:40:03 +0300 |
| commit | 6dfe4cbc6b8717223c631e80af6c7552576966e1 (patch) | |
| tree | 5fb0e2103cc6e8926370a5b1cee9a95fff4726a0 /source/blender/bmesh/intern/bmesh_polygon.h | |
| parent | 57a0cb797d60024357a3e3a64c1873844b0178bd (diff) | |
Polyfill Beautify: half-edge optimization
Was using an edge hash for triangle -> edge lookups,
updating triangle indices for each edge-rotation.
Replace this with half-edge which can rotate edges much more simply,
writing triangles back once the solution has been calculated.
Gives ~33% speedup in own tests.
Diffstat (limited to 'source/blender/bmesh/intern/bmesh_polygon.h')
| -rw-r--r-- | source/blender/bmesh/intern/bmesh_polygon.h | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/source/blender/bmesh/intern/bmesh_polygon.h b/source/blender/bmesh/intern/bmesh_polygon.h index 313caac1243..4ec8ea59018 100644 --- a/source/blender/bmesh/intern/bmesh_polygon.h +++ b/source/blender/bmesh/intern/bmesh_polygon.h @@ -27,7 +27,6 @@ * \ingroup bmesh */ -struct EdgeHash; struct Heap; #include "BLI_compiler_attrs.h" @@ -83,7 +82,7 @@ void BM_face_triangulate( const int quad_method, const int ngon_method, const bool use_tag, struct MemArena *pf_arena, - struct Heap *pf_heap, struct EdgeHash *pf_ehash + struct Heap *pf_heap ) ATTR_NONNULL(1, 2); void BM_face_splits_check_legal(BMesh *bm, BMFace *f, BMLoop *(*loops)[2], int len) ATTR_NONNULL(); |