griefith/test
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

BLI_kdtree: use the index as a tie breaker when finding duplicates

Browse Source 
Use the index as a tie breaker for deterministic results with the
"Merge by Distance" operator.

Ref !147252
This commit is contained in:
Campbell Barton
2025-10-03 11:36:04 +10:00
parent cc687df8ea
commit 2752b8a400
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
source/blender/blenlib/intern/kdtree_impl.h
View File

@@ -940,7 +940,10 @@ int BLI_kdtree_nd_(calc_duplicates_cb)(const KDTree *tree,
else if (target_index != neighbor_index) {
float &dist_sq_best = duplicates_dist_sq[neighbor_index];
/* Steal the target if it's closer. */
if (dist_sq < dist_sq_best) {
if ((dist_sq < dist_sq_best) ||
/* Pick the lowest index as a tie breaker for a deterministic result. */
((dist_sq == dist_sq_best) && (node_index < target_index)))
{
dist_sq_best = dist_sq;
duplicates[neighbor_index] = node_index;
}