|
| static BMFace ** | blender::bm_mesh_region_match_pair (UIDWalk *w_src, UIDWalk *w_dst, BMEdge *e_src, BMEdge *e_dst, const uint faces_src_region_len, const uint verts_src_region_len, uint *r_faces_result_len) |
| static void | blender::bm_face_array_visit (BMFace **faces, const uint faces_len, uint *r_verts_len, bool visit_faces) |
| int | blender::BM_mesh_region_match (BMesh *bm, BMFace **faces_region, uint faces_region_len, ListBaseT< LinkData > *r_face_regions) |
| static int | blender::facestep_sort (const void *a, const void *b) |
| static bool | blender::bm_uidwalk_facestep_begin (UIDWalk *uidwalk, UIDFaceStep *fstep) |
| static void | blender::bm_uidwalk_facestep_end (UIDWalk *uidwalk, UIDFaceStep *fstep) |
| static void | blender::bm_uidwalk_facestep_free (UIDWalk *uidwalk, UIDFaceStep *fstep) |
|
| #define | PRIME_VERT_INIT 100003 |
| using | blender::UID_Int = uintptr_t |
| using | blender::BMFaceIndexSet = Set<BMFace *, 4, DefaultProbingStrategy, BMElemIndexHash, BMElemIndexEq> |
| using | blender::SUID_Int = intptr_t |
| BLI_INLINE bool | blender::bm_uidwalk_face_test (UIDWalk *uidwalk, BMFace *f) |
| BLI_INLINE bool | blender::bm_uidwalk_vert_lookup (UIDWalk *uidwalk, BMVert *v, UID_Int *r_uid) |
| BLI_INLINE bool | blender::bm_uidwalk_face_lookup (UIDWalk *uidwalk, BMFace *f, UID_Int *r_uid) |
| static uint | blender::ghashutil_bmelem_indexhash (const void *key) |
| static bool | blender::ghashutil_bmelem_indexcmp (const void *a, const void *b) |
| static GHash * | blender::ghash_bmelem_new_ex (const char *info, const uint nentries_reserve) |
| static GHash * | blender::ghash_bmelem_new (const char *info) |
| static void | blender::bm_uidwalk_init (UIDWalk *uidwalk, const uint faces_src_region_len, const uint verts_src_region_len) |
| static void | blender::bm_uidwalk_clear (UIDWalk *uidwalk) |
| static void | blender::bm_uidwalk_free (UIDWalk *uidwalk) |
| static UID_Int | blender::bm_uidwalk_calc_vert_uid (UIDWalk *uidwalk, BMVert *v) |
| static UID_Int | blender::bm_uidwalk_calc_face_uid (UIDWalk *uidwalk, BMFace *f) |
| static void | blender::bm_uidwalk_rehash_reserve (UIDWalk *uidwalk, uint rehash_store_len_new) |
| static void | blender::bm_uidwalk_rehash (UIDWalk *uidwalk) |
| static void | blender::bm_uidwalk_rehash_facelinks (UIDWalk *uidwalk, LinkNode *faces, const uint faces_len, const bool is_init) |
| static bool | blender::bm_vert_is_uid_connect (UIDWalk *uidwalk, BMVert *v) |
| static void | blender::bm_uidwalk_pass_add (UIDWalk *uidwalk, LinkNode *faces_pass, const uint faces_pass_len) |
| static uint | blender::bm_uidwalk_init_from_edge (UIDWalk *uidwalk, BMEdge *e) |
| BLI_INLINE intptr_t | blender::abs_intptr (intptr_t a) |
| static bool | blender::bm_edge_is_region_boundary (BMEdge *e) |
| static void | blender::bm_face_region_pivot_edge_use_best (const Map< BMVert *, SUID_Int > &gh, BMEdge *e_test, BMEdge **r_e_pivot_best, SUID_Int e_pivot_best_id[2]) |
| static SUID_Int | blender::bm_face_region_vert_boundary_id (BMVert *v) |
| static SUID_Int | blender::bm_face_region_vert_pass_id (const Map< BMVert *, SUID_Int > &gh, BMVert *v) |
| static BMEdge * | blender::bm_face_region_pivot_edge_find (BMFace **faces_region, uint faces_region_len, uint verts_region_len, uint *r_depth) |
Given a contiguous region of faces, find multiple matching regions (based on topology) and return them.
Implementation:
- Given a face region, find its topological center.
- Compare this with other vertices surrounding geometry with this ones. (reduce the search space by creating a connectivity ID per vertex and only run comprehensive tests on those).
- All hashes must be order independent so matching topology can be identified.
- The term UID here doesn't mean each ID is initially unique. (uniqueness is improved by re-hashing with connected data).
Definition in file bmesh_region_match.cc.