49 ListBaseT<BMEdgeLoopStore> eloops = {
nullptr};
51 .use_vert_junction =
true,
62 r_chains.
append(std::move(chain));
72 const int points_num = positions.
size();
76 r_center += positions[i];
78 r_center /=
float(points_num);
80 r_accumulated_lengths.
resize(points_num - 1);
87 return accumulated_lengths.
last() > 0.0f;
92 const int verts_num = chain.
verts.size();
112 const int verts_num = chain.
verts.size();
126 float sample_factor = (i == 0) ? 0.0f :
128 sample_lengths[i] = sample_factor * stroke_length_total;
151 const int verts_num = chain.
verts.size();
155 float total_distance = 0.0f;
159 return total_distance;
185 const int verts_num = r_chain.
verts.size();
193 bool has_best =
false;
195 auto check_intersection_fn = [&](
const float3 &ray_dir) {
210 closest_on_stroke) != 0)
215 float dist_seg =
math::distance(stroke_seg_start, stroke_seg_end);
216 float dist_to_start =
math::distance(stroke_seg_start, closest_on_stroke);
217 float dist_to_end =
math::distance(stroke_seg_end, closest_on_stroke);
223 if (dist_sq_test < dist_sq_best) {
224 dist_sq_best = dist_sq_test;
225 v_co_best = closest_on_stroke;
251 check_intersection_fn(ray_dir);
260 check_intersection_fn(ray_dir);
318 if (stroke_data_in) {
321 stroke_data.
points = points;
323 strokes.
append(stroke_data);
334 float3 points_fallback[2];
340 float3 chain_start_co =
float3(chain.verts.first()->co);
343 points_fallback[0] = chain_start_co;
344 points_fallback[1] = chain_end_co;
348 stroke_best = &stroke_fallback;
356 const int use_count = strokes[i].use_count;
359 if (use_count < use_count_best ||
360 (use_count == use_count_best && dist_sq_test < dist_sq_best))
362 use_count_best = use_count;
363 dist_sq_best = dist_sq_test;
368 strokes[index_best].use_count++;
369 stroke_best = &strokes[index_best];
375 std::reverse(reversed_chain.
verts.begin(), reversed_chain.
verts.end());
381 if (reversed_dist < forward_dist) {
382 chain = std::move(reversed_chain);
384 calculate_verts(*stroke_best, method, factor, lock_x, lock_y, lock_z, chain);
#define BM_elem_flag_test(ele, hflag)
#define BM_ITER_ELEM(ele, iter, data, itype)
Span< T > as_span() const
constexpr IndexRange()=default
constexpr int64_t size() const
constexpr const T & last(const int64_t n=0) const
void append(const T &value)
IndexRange index_range() const
void resize(const int64_t new_size)
MutableSpan< T > as_mutable_span()
const T & last(const int64_t n=0) const
void accumulate_lengths(const Span< T > values, const bool cyclic, MutableSpan< float > lengths)
void sample_at_lengths(Span< float > accumulated_segment_lengths, Span< float > sample_lengths, MutableSpan< int > r_segment_indices, MutableSpan< float > r_factors)
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 length_squared(const VecBase< T, Size > &a)
T distance(const T &a, const T &b)
T interpolate(const T &a, const T &b, const FactorT &t)
MatBase< T, NumCol, NumRow > normalize(const MatBase< T, NumCol, NumRow > &a)
T distance_squared(const VecBase< T, Size > &a, const VecBase< T, Size > &b)
int isect_line_line(const float3 &v1, const float3 &v2, const float3 &v3, const float3 &v4, float3 &r_i1, float3 &r_i2)
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 void sample_stroke_positions(const StrokeData &stroke_data, const ToAnnotationChain &chain, const int method, MutableSpan< float3 > r_positions)
constexpr float max_ray_distance
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.
ATTR_WARN_UNUSED_RESULT const BMLoop * l
void BM_mesh_edgeloops_free(ListBaseT< BMEdgeLoopStore > *eloops)
float BMO_slot_float_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
static void measure_positions(const Span< float3 > positions, float3 &r_center, Vector< float > &r_accumulated_lengths)
void BM_mesh_elem_hflag_disable_all(BMesh *bm, const char htype, const char hflag, const bool respecthide)
ATTR_WARN_UNUSED_RESULT const BMVert * v
static void calculate_verts(const StrokeData &stroke_data, const int method, const float factor, const bool lock_x, const bool lock_y, const bool lock_z, ToAnnotationChain &r_chain)
BLI_INLINE BMVert * BM_edge_other_vert(BMEdge *e, const BMVert *v) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL()
void * BMO_slot_ptr_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
static bool is_total_length_valid(const Span< float > accumulated_lengths)
constexpr float segment_epsilon
static bool edge_shares_face_with_tagged_edge(BMEdge *e, BMVert *v)
static void calc_annotation_input_chains_from_bm(BMesh *bm, Vector< ToAnnotationChain > &r_chains)
bool BMO_slot_bool_get(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name)
@ TO_ANNOTATION_SPREAD_EVENLY
constexpr float normal_length_epsilon
static float calculate_alignment_distance(const ToAnnotationChain &chain, const StrokeData &stroke_data, const int method)
void bmo_fit_edge_loops_to_annotation_exec(BMesh *bm, BMOperator *op)
VecBase< float, 3 > float3
constexpr float ray_length
static void calculate_chain_lengths(ToAnnotationChain &chain)
static void calculate_stroke_lengths(StrokeData &stroke_data)
ATTR_WARN_UNUSED_RESULT const BMVert const BMEdge * e
BMLoop * BM_loop_other_edge_loop(BMLoop *l, BMVert *v)
KERNEL_FEATURE_LIGHT_PASSES KERNEL_FEATURE_PATH_GUIDING float
struct BMOpSlot slots_in[BMO_OP_MAX_SLOTS]
Vector< float > accumulated_lengths
Vector< float > accumulated_lengths