33using bke::CurvesGeometry;
71 const int tot_added_curves = root_positions.
size();
74 for (
const int i : range) {
75 const float3 root = root_positions[i];
76 std::array<KDTreeNew<float3>::Nearest,
max_neighbors> nearest_n;
77 const int found_neighbors = old_roots_kdtree.
find_nearest_n(root, nearest_n);
78 float tot_weight = 0.0f;
79 for (
const int neighbor_i :
IndexRange(found_neighbors)) {
81 const float weight = 1.0f / std::max(std::sqrt(nearest.
distance_sq), 0.00001f);
83 neighbors_per_curve[i].append({nearest.
index, weight});
87 neighbor.weight /= tot_weight;
91 offset_data.
resize(tot_added_curves + 1);
93 for (const int i : range) {
94 offset_data[i] = neighbors_per_curve[i].size();
101 for (const int dst_i : range) {
102 const IndexRange neighbor_range = offsets[dst_i];
103 for (const int i : neighbor_range.index_range()) {
104 index_data[neighbor_range[i]] = neighbors_per_curve[dst_i][i].index;
105 weight_data[neighbor_range[i]] = neighbors_per_curve[dst_i][i].weight;
112 const int old_curves_num,
116 const float4x4 &surface_to_curves_normal_mat)
119 const int added_curves_num = root_positions_cu.
size();
123 for (
const int i : range) {
124 const int curve_i = old_curves_num + i;
125 const IndexRange points = points_by_curve[curve_i];
126 const float3 &root_cu = root_positions_cu[i];
127 const float length = new_lengths_cu[i];
128 const float3 &normal_su = new_normals_su[i];
143 const int old_curves_num,
153 const int added_curves_num = root_positions_cu.
size();
159 for (
const int added_curve_i : range) {
160 const IndexRange neighbors = neighbor_offsets[added_curve_i];
161 const int curve_i = old_curves_num + added_curve_i;
162 const IndexRange points = points_by_curve[curve_i];
164 const float length_cu = new_lengths_cu[added_curve_i];
165 const float3 &normal_su = new_normals_su[added_curve_i];
169 const float3 &root_cu = root_positions_cu[added_curve_i];
173 const float3 tip_cu = root_cu + length_cu * normal_cu;
178 positions_cu.
slice(points).
fill(root_cu);
180 for (
const int neighbor_i : neighbors) {
181 const int neighbor_curve_i = neighbor_indices[neighbor_i];
182 const float neighbor_weight = neighbor_weights[neighbor_i];
183 const float2 neighbor_uv = uv_coords[neighbor_curve_i];
190 corner_tris[
result.tri_index],
result.bary_weights, corner_normals_su);
196 float normal_rotation_cu[3][3];
199 const IndexRange neighbor_points = points_by_curve[neighbor_curve_i];
200 const float3 &neighbor_root_cu = positions_cu[neighbor_points[0]];
210 if (neighbor_positions_cu.
size() == 1) {
216 const float neighbor_length_cu = lengths.
last();
219 const float length_factor = std::min(1.0f, length_cu / neighbor_length_cu);
220 const float resample_factor = (1.0f / (points.
size() - 1.0f)) * length_factor;
222 sample_lengths[i] = i * resample_factor * neighbor_length_cu;
231 neighbor_positions_cu[indices[i] + 1],
233 const float3 relative_to_root_cu = sample_cu - neighbor_root_cu;
234 float3 rotated_relative_coord = relative_to_root_cu;
235 mul_m3_v3(normal_rotation_cu, rotated_relative_coord);
236 positions_cu[points[i]] += neighbor_weight * rotated_relative_coord;
248 if (
const std::optional<float> single = radii.
get_if_single()) {
253 curves.radius_for_write().slice(new_points_range).fill(radius);
254 curves.tag_radii_changed();
258 const int old_curves_num,
265 const int added_curves_num = new_lengths_cu.
size();
277 for (
const int i : range) {
278 const IndexRange neighbors = neighbor_offsets[i];
279 const float length_cu = new_lengths_cu[i];
280 const int curve_i = old_curves_num + i;
281 const IndexRange points = points_by_curve[curve_i];
291 for (
const int neighbor_i : neighbors) {
292 const int neighbor_curve_i = neighbor_indices[neighbor_i];
293 const float neighbor_weight = neighbor_weights[neighbor_i];
294 const IndexRange neighbor_points = points_by_curve[neighbor_curve_i];
296 const Span<float> neighbor_radii_cu = radius_attr.
span.slice(neighbor_points);
301 const float neighbor_length_cu = lengths.
last();
304 const float length_factor = std::min(1.0f, length_cu / neighbor_length_cu);
305 const float resample_factor = (1.0f / (points.
size() - 1.0f)) * length_factor;
307 sample_lengths[i] = i * resample_factor * neighbor_length_cu;
316 neighbor_radii_cu[indices[i]], neighbor_radii_cu[indices[i] + 1], factors[i]);
318 radii_cu[points[i]] += neighbor_weight * sample_cu;
344 for (
const int i : inputs.
uvs.index_range()) {
356 surface_positions[surface_corner_verts[tri[0]]],
357 surface_positions[surface_corner_verts[tri[1]]],
358 surface_positions[surface_corner_verts[tri[2]]]);
367 if (use_interpolation) {
371 curve_neighbor_offset_data,
372 curve_neighbor_index_data,
373 curve_neighbor_weight_data);
376 const int added_curves_num = root_positions_cu.
size();
377 const int old_points_num =
curves.points_num();
378 const int old_curves_num =
curves.curves_num();
379 const int new_curves_num = old_curves_num + added_curves_num;
382 curves.resize(old_points_num, new_curves_num);
383 if (new_curves_num == 0) {
389 Array<int> new_point_counts_per_curve(added_curves_num);
396 curve_neighbor_index_data.
as_span(),
397 curve_neighbor_weight_data.
as_span(),
403 curve_offsets[old_curves_num] = old_points_num;
404 int offset = old_points_num;
405 for (
const int i : new_point_counts_per_curve.
index_range()) {
406 const int point_count_in_curve = new_point_counts_per_curve[i];
407 curve_offsets[old_curves_num + i + 1] = offset + point_count_in_curve;
408 offset += point_count_in_curve;
411 const int new_points_num =
curves.offsets().last();
412 curves.resize(new_points_num, new_curves_num);
429 for (
const int curve_i : range) {
430 const IndexRange points = points_by_curve[curve_i];
432 for (
const int segment_i : points.
drop_back(1)) {
433 const float3 &p1 = positions_cu[segment_i];
434 const float3 &p2 = positions_cu[segment_i + 1];
437 lengths[curve_i] =
length;
442 curve_neighbor_index_data.
as_span(),
443 curve_neighbor_weight_data.
as_span(),
464 curve_neighbor_index_data.
as_span(),
465 curve_neighbor_weight_data.
as_span(),
490 curve_neighbor_index_data.
as_span(),
491 curve_neighbor_weight_data.
as_span());
508 curve_neighbor_index_data.
as_span(),
509 curve_neighbor_weight_data.
as_span(),
510 resolution.span.take_back(added_curves_num));
514 resolution.span.take_back(added_curves_num).fill(12);
#define PRF_scope(category)
Span< T > as_span() const
MutableSpan< T > as_mutable_span()
const T & last(const int64_t n=0) const
IndexRange index_range() const
void fill(const T &value) const
constexpr IndexRange drop_back(int64_t n) const
constexpr int64_t size() const
constexpr bool is_empty() const
constexpr IndexRange()=default
int find_nearest_n(const T &position, MutableSpan< Nearest > r_nearest) const
constexpr int64_t size() const
constexpr MutableSpan slice(const int64_t start, const int64_t size) const
constexpr MutableSpan take_back(const int64_t n) const
constexpr void fill(const T &value) const
constexpr IndexRange index_range() const
constexpr void copy_from(Span< T > values) const
constexpr MutableSpan take_front(const int64_t n) const
constexpr int64_t size() const
std::optional< T > get_if_single() const
void append(const T &value)
void resize(const int64_t new_size)
Span< T > as_span() const
GSpanAttributeWriter lookup_for_write_span(StringRef name)
Result sample(const float2 &query_uv) const
IndexRange index_range() const
VecBase< float, D > step(VecOp< float, D >, VecOp< float, D >) RET
float length(VecOp< float, D >) RET
T mix3(const float3 &weights, const T &v0, const T &v1, const T &v2)
void mix_groups(GSpan src, OffsetIndices< int > groups, Span< int > all_indices, std::optional< Span< float > > all_weights, GMutableSpan dst)
T mix2(float factor, const T &a, const T &b)
void sample_corner_normals(Span< int3 > corner_tris, Span< int > tri_indices, Span< float3 > bary_coords, Span< float3 > src, const IndexMask &mask, MutableSpan< float3 > dst)
T sample_corner_attribute_with_bary_coords(const float3 &bary_weights, const int3 &corner_tri, const Span< T > corner_attribute)
auto attribute_filter_from_skip_ref(const Span< StringRef > skip)
void fill_attribute_range_default(MutableAttributeAccessor dst_attributes, AttrDomain domain, const AttributeFilter &attribute_filter, IndexRange range)
static void calc_radius_without_interpolation(CurvesGeometry &curves, const IndexRange new_points_range, const float radius)
Vector< NeighborCurve, max_neighbors > NeighborCurves
AddCurvesOnMeshOutputs add_curves_on_mesh(bke::CurvesGeometry &curves, const AddCurvesOnMeshInputs &inputs)
static constexpr int max_neighbors
float3 compute_surface_point_normal(const int3 &tri, const float3 &bary_coord, Span< float3 > corner_normals)
static void calc_radius_with_interpolation(CurvesGeometry &curves, const int old_curves_num, const float radius, const Span< float > new_lengths_cu, const OffsetIndices< int > neighbor_offsets, const Span< int > neighbor_indices, const Span< float > neighbor_weights)
static void calc_position_without_interpolation(CurvesGeometry &curves, const int old_curves_num, const Span< float3 > root_positions_cu, const Span< float > new_lengths_cu, const Span< float3 > new_normals_su, const float4x4 &surface_to_curves_normal_mat)
static void find_curve_neighbors(const Span< float3 > root_positions, const KDTreeNew< float3 > &old_roots_kdtree, Vector< int > &offset_data, Vector< int > &index_data, Vector< float > &weight_data)
static void calc_position_with_interpolation(CurvesGeometry &curves, const Span< float3 > root_positions_cu, const OffsetIndices< int > neighbor_offsets, const Span< int > neighbor_indices, const Span< float > neighbor_weights, const int old_curves_num, const Span< float > new_lengths_cu, const Span< float3 > new_normals_su, const bke::CurvesSurfaceTransforms &transforms, const Span< int3 > corner_tris, const ReverseUVSampler &reverse_uv_sampler, const Span< float3 > corner_normals_su)
static void calc_straight_curve_positions(const float3 &a, const float3 &b, MutableSpan< float3 > dst)
int segments_num(const int points_num, const bool cyclic)
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)
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)
VecBase< T, 3 > transform_direction(const MatBase< T, 3, 3 > &mat, const VecBase< T, 3 > &direction)
VecBase< T, 3 > transform_point(const CartesianBasis &basis, const VecBase< T, 3 > &v)
void copy_group_sizes(OffsetIndices< int > offsets, const IndexMask &mask, MutableSpan< int > sizes)
OffsetIndices< int > accumulate_counts_to_offsets(MutableSpan< int > counts_to_offsets, int start_offset=0)
void parallel_for(const IndexRange range, const int64_t grain_size, const Function &function, const TaskSizeHints &size_hints=detail::TaskSizeHints_Static(1))
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
void mul_m3_v3(const float M[3][3], float r[3])
MINLINE int compare_ff_relative(float a, float b, float max_diff, int max_ulps)
MatBase< float, 4, 4 > float4x4
VecBase< float, 2 > float2
VecBase< int32_t, 3 > int3
VecBase< float, 3 > float3
void rotation_between_vecs_to_mat3(float m[3][3], const float v1[3], const float v2[3])
MutableVArraySpan< T > span
IndexRange new_points_range
IndexRange new_curves_range