diff options
author | Campbell Barton <ideasman42@gmail.com> | 2020-07-21 05:54:23 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2020-07-21 07:32:21 +0300 |
commit | b88dd3b8e7b9c02ae08d4679bb427963c5d21250 (patch) | |
tree | ca6555055dbddb41853bdf8270a6719dfa385556 /source/blender/bmesh/intern | |
parent | 50fe187443b8fdd9aa462e51bc49dcaa8f33b67a (diff) |
UV: remove selection threshold for nearby coordinates
Internally UV selection considered close UV's to be connected.
While this could be convenient in some cases,
it complicates logic for more advanced selection operations that
need to check when UV's should be considered part of the same vertex
since simple threshold checks would give different results depending
on the order of UV's tested.
Users must now run "Merge by Distance" instead of relying
on this selection threshold.
Diffstat (limited to 'source/blender/bmesh/intern')
-rw-r--r-- | source/blender/bmesh/intern/bmesh_query_uv.c | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/source/blender/bmesh/intern/bmesh_query_uv.c b/source/blender/bmesh/intern/bmesh_query_uv.c index 72f264e148c..b9ea51f0c4d 100644 --- a/source/blender/bmesh/intern/bmesh_query_uv.c +++ b/source/blender/bmesh/intern/bmesh_query_uv.c @@ -32,11 +32,6 @@ #include "bmesh.h" #include "intern/bmesh_private.h" -static bool compare_v2v2_v2(const float v1[2], const float v2[2], const float limit[2]) -{ - return (compare_ff(v1[0], v2[0], limit[0]) && compare_ff(v1[1], v2[1], limit[1])); -} - static void uv_aspect(const BMLoop *l, const float aspect[2], const int cd_loop_uv_offset, @@ -120,26 +115,6 @@ float BM_face_uv_calc_cross(const BMFace *f, const int cd_loop_uv_offset) /** * Check if two loops that share an edge also have the same UV coordinates. */ -bool BM_loop_uv_share_edge_check_with_limit(BMLoop *l_a, - BMLoop *l_b, - const float limit[2], - const int cd_loop_uv_offset) -{ - BLI_assert(l_a->e == l_b->e); - MLoopUV *luv_a_curr = BM_ELEM_CD_GET_VOID_P(l_a, cd_loop_uv_offset); - MLoopUV *luv_a_next = BM_ELEM_CD_GET_VOID_P(l_a->next, cd_loop_uv_offset); - MLoopUV *luv_b_curr = BM_ELEM_CD_GET_VOID_P(l_b, cd_loop_uv_offset); - MLoopUV *luv_b_next = BM_ELEM_CD_GET_VOID_P(l_b->next, cd_loop_uv_offset); - if (l_a->v != l_b->v) { - SWAP(MLoopUV *, luv_b_curr, luv_b_next); - } - return (compare_v2v2_v2(luv_a_curr->uv, luv_b_curr->uv, limit) && - compare_v2v2_v2(luv_a_next->uv, luv_b_next->uv, limit)); -} - -/** - * Check if two loops that share an edge also have the same UV coordinates. - */ bool BM_loop_uv_share_edge_check(BMLoop *l_a, BMLoop *l_b, const int cd_loop_uv_offset) { BLI_assert(l_a->e == l_b->e); |