81 ListBaseT<BMEdgeLoopStore> eloops = {
nullptr};
83 .use_vert_junction =
true,
96 bool all_duplicate =
true;
97 for (
const int i : chain.
verts.index_range().drop_back(1)) {
101 all_duplicate =
false;
106 if (!all_duplicate) {
107 r_chains.
append(std::move(chain));
120 const int verts_num = chain.
verts.size();
139 const bool is_closed,
142 const int verts_num = coords.
size();
146 const int num_segments = is_closed ? verts_num : verts_num - 1;
149 for (
const int i :
IndexRange(num_segments)) {
150 segment_length[i] = distances[i + 1] - distances[i];
151 if (!(segment_length[i] > 0.0f)) {
171 lower_diag[i] = segment_length[i_prev];
172 diag[i] = 2.0f * (segment_length[i_prev] + segment_length[i]);
173 upper_diag[i] = segment_length[i];
174 rhs[i] = 3.0f * (((coords[i_next] - coords[i]) / segment_length[i]) -
175 ((coords[i] - coords[i_prev]) / segment_length[i_prev]));
183 const int interior = verts_num - 2;
189 for (
const int i_curr :
IndexRange(interior)) {
190 const int i_next = i_curr + 1;
191 lower_diag[i_curr] = segment_length[i_curr];
192 diag[i_curr] = 2.0f * (segment_length[i_curr] + segment_length[i_next]);
193 upper_diag[i_curr] = segment_length[i_next];
194 rhs[i_curr] = 3.0f * (((coords[i_next + 1] - coords[i_next]) / segment_length[i_next]) -
195 ((coords[i_next] - coords[i_curr]) / segment_length[i_curr]));
206 for (
const int i :
IndexRange(num_segments)) {
209 const float coeff_a = coords[i];
210 const float coeff_b = ((coords[i_next] - coords[i]) / segment_length[i]) -
211 (segment_length[i] * (c_vals[i_next] + 2.0f * c_vals[i])) / 3.0f;
212 const float coeff_c = c_vals[i];
213 const float coeff_d = (c_vals[i_next] - c_vals[i]) / (3.0f * segment_length[i]);
214 r_coeffs.
append({coeff_a, coeff_b, coeff_c, coeff_d, distances[i]});
222 knot_distances, [&](
const float value) {
return value <= target_distance; });
223 return std::clamp(segment_index, 0,
int(knot_distances.
size()) - 2);
231 const float target_distance)
234 const float dt = target_distance - coeffs_x[segment].x;
240 return float3(cx.
a + dt * (cx.
b + dt * (cx.
c + dt * cx.
d)),
241 cy.
a + dt * (cy.
b + dt * (cy.
c + dt * cy.
d)),
242 cz.
a + dt * (cz.
b + dt * (cz.
c + dt * cz.
d)));
261 const int verts_num = chain.verts.size();
275 measure.
positions, sample_indices, sample_factors, new_positions);
295 const int seg = sample_indices[i];
300 measure.
knot_distances, coeffs_x, coeffs_y, coeffs_z, target_dist);
306 if (!chain.is_closed &&
ELEM(i, 0, verts_num - 1)) {
310 float3 new_pos = new_positions[i];
#define BM_elem_flag_test(ele, hflag)
Span< T > as_span() const
MutableSpan< T > as_mutable_span()
void reinitialize(const int64_t new_size)
constexpr IndexRange()=default
constexpr int64_t size() const
void append(const T &value)
constexpr MutableSpan drop_front(const int64_t n) const
constexpr Span drop_front(int64_t n) const
int64_t last_if(const Range &range, Predicate &&predicate)
void accumulate_lengths(const Span< T > values, const bool cyclic, MutableSpan< float > lengths)
void interpolate(const Span< T > src, const Span< int > indices, const Span< float > factors, MutableSpan< T > dst)
void sample_uniform(Span< float > accumulated_segment_lengths, bool include_last_point, MutableSpan< int > r_segment_indices, MutableSpan< float > r_factors)
T interpolate(const T &a, const T &b, const FactorT &t)
T mod_periodic(const T &a, const T &b)
T distance_squared(const VecBase< T, Size > &a, const VecBase< T, Size > &b)
bool BLI_tridiagonal_solve_cyclic(const float *a, const float *b, const float *c, const float *d, float *r_x, int count)
Solve a possibly cyclic tridiagonal system using the Sherman-Morrison formula.
ListBaseT< LinkData > * BM_edgeloop_verts_get(BMEdgeLoopStore *el_store)
int BM_mesh_edgeloops_find(BMesh *bm, ListBaseT< BMEdgeLoopStore > *r_eloops, FunctionRef< bool(BMEdge *)> test_fn, const BMEdgeLoopFind_Params *params)
int BMO_slot_int_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
static SpaceMeasurements measure_chain(const SpaceChainData &chain)
MINLINE void copy_v3_v3(float r[3], const float a[3])
void BMO_slot_buffer_hflag_enable(BMesh *bm, BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name, char htype, char hflag, bool do_flush)
BMO_FLAG_BUFFER.
void BM_mesh_edgeloops_free(ListBaseT< BMEdgeLoopStore > *eloops)
bool BLI_tridiagonal_solve(const float *a, const float *b, const float *c, const float *d, float *r_x, int count)
Solve a tridiagonal system of equations:
float BMO_slot_float_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
static int calc_spline_segment(Span< float > knot_distances, const float target_distance)
constexpr float SPACE_EPSILON
void BM_mesh_elem_hflag_disable_all(BMesh *bm, const char htype, const char hflag, const bool respecthide)
@ SPACE_EDGE_LOOPS_EVENLY_INTERP_LINEAR
bool BM_edgeloop_is_closed(BMEdgeLoopStore *el_store)
static void get_space_input_chains(BMesh *bm, Vector< SpaceChainData > &r_chains)
static void calculate_splines_axis(const Span< float > distances, const Span< float > coords, const bool is_closed, Array< SplineCoeffs > &r_coeffs)
bool BMO_slot_bool_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
void bmo_space_edge_loops_evenly_exec(BMesh *bm, BMOperator *op)
static float3 evaluate_cubic(Span< float > tknots, Span< SplineCoeffs > coeffs_x, Span< SplineCoeffs > coeffs_y, Span< SplineCoeffs > coeffs_z, const float target_distance)
VecBase< float, 3 > float3
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
constexpr float DUPLICATE_POSITION_THRESHOLD
struct BMOpSlot slots_in[BMO_OP_MAX_SLOTS]
Array< float3 > positions
Array< float > knot_distances