# System Solver node Problem: There point cloud. Each point have some vector to move. Now, each point should have way to say if it movement vector should be limited. And that limitation is based on other points and its vectors (limited in the same way). ## Correct solution: A system of linear (or more complex equations) is a constraints set. Each variable is a vetcor or float value. Due to the quantitative solution according to the Newton method, this can be approximated to the most optimal form. - [Wikipedia: Newton's method](https://en.wikipedia.org/wiki/Newton%27s_method) - [Newton’s method based collision avoidance in a CAD environment on ball nut grinding](https://link.springer.com/article/10.1007/s00170-015-7796-5) ## Cannot be applied: - Arbitrary (non-mathematical) operations on attributes (sampling, comparison, switching, random, ...) - There is no ready-made system that allows you to find the derivative for fields and apply it. ## Our solution: Field task. Need to be able to set a lot of fields that can be calculated in a virtual context: - Substep - Random state of other vectors ### If try the described algorithm: 1. Move one vertex. 1. Check all other vertices and their constraints. 1. Move another vertex...
Last changed by  
 
mod nop
112

Read more

static void sort_small_groups

static void atomic_a_swap_b(int &a, int &b){int prew_a_state = a;while (true) {const int result = atomic_cas_int32(&a, prew_a_state, b);if (result == b) {break;}prew_a_state = result;}b = prew_a_state;}

9/15/2023
static Array<int> reverse_indi

static Array<int> reverse_indices_in_groups_old(const Span<int> group_indices, const OffsetIndices<int> offsets){SCOPED_TIMER_AVERAGED(func);if (group_indices.is_empty()) {return {};}BLI_assert(*std::max_element(group_indices.begin(), group_indices.end()) < offsets.size());BLI_assert(*std::min_element(group_indices.begin(), group_indices.end()) >= 0);Array<int> counts(offsets.size(), -1);Array<int> results(group_indices.size());threading::parallel_for(group_indices.index_range(), 1024, [&](const IndexRange range) {for (const int64_t i : range) {const int group_index = group_indices[i];const int index_in_group = atomic_add_and_fetch_int32(&counts[group_index], 1);results[offsets[group_index][index_in_group]] = int(i);}});sort_small_groups(offsets, 1024, results);return results;}

9/7/2023
Geometry Nodes: Instance Component 2.0.

Currently, Geometry Nodes Instances have small interface for interaction:

9/2/2023
Grouping of random points by it curve index

static Array<int> gather_reverse(const Span<int> group_indices){SCOPED_TIMER_AVERAGED(func);

8/8/2023
Read more from mod nop
Published on HackMD