119 const bool use_correct_order_on_merge,
120 int **r_vert_merge_map,
121 int *r_vert_merge_map_len)
133 float plane_co[3], plane_no[3];
135 int *vtmap_a =
nullptr, *vtmap_b =
nullptr;
139 mtx[axis][axis] = -1.0f;
142 if (mirror_ob !=
nullptr) {
149 mul_m4_m4m4(tmp, tmp, ob->object_to_world().ptr());
164 float ob_scale[3] = {
171 if (
LIKELY(ob_scale_max != 0.0f)) {
172 mul_v3_fl(ob_scale, 1.0f / ob_scale_max);
177 else if (do_bisect) {
183 Mesh *mesh_bisect =
nullptr;
186 mmd, mesh, axis, plane_co, plane_no);
190 const int src_verts_num = mesh->
verts_num;
191 const int src_edges_num = mesh->edges_num;
193 const int src_loops_num = mesh->corners_num;
196 mesh, src_verts_num * 2, src_edges_num * 2, src_faces.
size() * 2, src_loops_num * 2);
208 &mesh->face_data, &result->face_data, 0, src_faces.
size(), src_faces.
size());
212 *r_vert_merge_map =
static_cast<int *
>(
215 vtmap_a = *r_vert_merge_map;
216 vtmap_b = *r_vert_merge_map + src_verts_num;
218 *r_vert_merge_map_len = 0;
223 for (
int i = 0; i < src_verts_num; i++) {
224 const int vert_index_prev = i;
225 const int vert_index = src_verts_num + i;
242 if (use_correct_order_on_merge) {
247 (*r_vert_merge_map_len)++;
250 mid_v3_v3v3(positions[vert_index], positions[vert_index_prev], positions[vert_index]);
251 copy_v3_v3(positions[vert_index_prev], positions[vert_index]);
264 *vtmap_a = src_verts_num + i;
265 (*r_vert_merge_map_len)++;
268 mid_v3_v3v3(positions[vert_index], positions[vert_index_prev], positions[vert_index]);
269 copy_v3_v3(positions[vert_index_prev], positions[vert_index]);
286 for (a = 0; a < totshape; a++) {
287 float(*
cos)[3] =
static_cast<float(*)[3]
>(
289 for (
int i = src_verts_num; i < result->verts_num; i++) {
301 result_edges[i] += src_verts_num;
304 result_face_offsets.
take_front(src_faces.
size()).copy_from(mesh->face_offsets().drop_back(1));
306 result_face_offsets[src_faces.
size() + i] = src_faces[i].start() + src_loops_num;
313 const int mirror_i = src_faces.
size() + i;
319 &mesh->corner_data, &result->corner_data, src_face.
start(), mirror_face.
start(), 1);
321 for (
int j = 1; j < mirror_face.
size(); j++) {
323 &mesh->corner_data, &result->corner_data, src_face[j], mirror_face.
last(j - 1), 1);
327 const int e = mirror_face_edges.
first();
328 for (
int j = 0; j < mirror_face.
size() - 1; j++) {
329 mirror_face_edges[j] = mirror_face_edges[j + 1];
331 mirror_face_edges.
last() =
e;
336 result_corner_verts[i] += src_verts_num;
339 result_corner_edges[i] += src_edges_num;
342 if (!mesh->runtime->subsurf_optimal_display_edges.is_empty()) {
344 result->runtime->subsurf_optimal_display_edges.resize(result->edges_num);
362 for (a = 0; a < totuv; a++) {
365 int j = src_loops_num;
367 for (; j-- > 0; dmloopuv++) {
369 float u = (*dmloopuv)[0];
374 (*dmloopuv)[0] = 1.0f - u + mmd->
uv_offset[0];
378 float v = (*dmloopuv)[1];
383 (*dmloopuv)[1] = 1.0f -
v + mmd->
uv_offset[1];
394 result->faces_num > 0)
409 const VArraySpan sharp_edges = *attributes.lookup<
bool>(
"sharp_edge", AttrDomain::Edge);
410 const VArraySpan sharp_faces = *attributes.lookup<
bool>(
"sharp_face", AttrDomain::Face);
416 result->corner_to_face_map(),
417 result->vert_normals(),
418 result->face_normals(),
428 const int mirror_i = src_faces.
size() + i;
430 for (
const int j : src_face) {
431 int mirrorj = result_faces[mirror_i].start();
432 if (j > src_face.
start()) {
433 mirrorj += result_faces[mirror_i].
size() - (j - src_face.
start());
436 copy_v3_v3(corner_normals[mirrorj], corner_normals[j]);
437 mul_m4_v3(mtx_nor, corner_normals[mirrorj]);
441 lnors_spacearr.
spaces[space_index], corner_normals[mirrorj]);
449 MDeformVert *dvert = result->deform_verts_for_write().data() + src_verts_num;
450 int flip_map_len = 0;
453 for (
int i = 0; i < src_verts_num; dvert++, i++) {
455 if (use_correct_order_on_merge && do_vtargetmap &&
456 ((*r_vert_merge_map)[i + src_verts_num] != -1))
460 else if (!use_correct_order_on_merge && do_vtargetmap && ((*r_vert_merge_map)[i] != -1))
474 if (mesh_bisect !=
nullptr) {