Add a "dumb vector" storage option for custom normals, with the "custom_normal" attribute. Adjust the mesh normals caching to provide this attribute if it's available, and add a geometry node to store custom normals. ## Free Normals They're called "free" in the sense that they're just direction vectors in the object's local space, rather than the existing "smooth corner fan space" storage. They're also "free" in that they make further normals calculation very inexpensive, since we just use the custom normals instead. That's a big improvement from the existing custom normals storage, which usually significantly decreases viewport performance. For example, in a simple test file just storing the vertex normals on a UV sphere, using free normals gives 25 times better playback performance and 10% lower memory usage. Free normals are adjusted when applying a transformation to the entire mesh or when realizing instances, but in general they're not updated for vertex deformations. ## Set Mesh Normal Node The new geometry node allows storing free custom normals as well as the existing corner fan space normals. When free normals are chosen, free normals can be stored on vertices, faces, or face corners. Using the face corner domain is necessary to bake existing mixed sharp and smooth edges into the custom normal vectors. The node also has a mode for storing edge and mesh sharpness, meant as a "soft" replacement to the "Set Shade Smooth" node that's a bit more convenient. ## Normal Input Node The normal node outputs free custom normals mixed to whatever domain is requested. A "true normal" output that ignores custom normals and sharpness is added as well. Across Blender, custom normals are generally accessed via face and vertex normals, when "true normals" are not requested explicitly. In many cases that means they are mixed from the face corner domain. ## Future Work 1. There are many places where propagation of free normals could be improved. They should probably be normalized after mixing, and it may be useful to not just use 0 vectors for new elements. To keep the scope of this change smaller, that sort of thing generally isn't handled here. Searching `CD_NORMAL` gives a hint of where better propagation could be useful. 2. Free normals are displayed properly in edit mode, but the existing custom normal editing operators don't work with free normals yet. This will hopefully be fairly straightforward since custom normals are usually converted to `float3` for editing anyway. Edit mode changes aren't included here because they're unnecessary for the procedural custom normals use cases. 3. Most importers can probably switch to using free normals instead, or at least provide an option for it. That will give a significant import performance improvement, and an improvement of Blender's FPS for imported scenes too. Pull Request: https://projects.blender.org/blender/blender/pulls/132583
480 lines
18 KiB
C++
480 lines
18 KiB
C++
/* SPDX-FileCopyrightText: Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \file
|
|
* \ingroup bke
|
|
*/
|
|
|
|
#include "BLI_array.hh"
|
|
#include "BLI_math_geom.h"
|
|
#include "BLI_math_matrix.h"
|
|
#include "BLI_math_vector.h"
|
|
|
|
#include "DNA_meshdata_types.h"
|
|
#include "DNA_object_types.h"
|
|
|
|
#include "BKE_attribute.hh"
|
|
#include "BKE_deform.hh"
|
|
#include "BKE_lib_id.hh"
|
|
#include "BKE_mesh.hh"
|
|
#include "BKE_mesh_mirror.hh"
|
|
#include "BKE_modifier.hh"
|
|
|
|
#include "bmesh.hh"
|
|
#include "bmesh_tools.hh"
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
Mesh *BKE_mesh_mirror_bisect_on_mirror_plane_for_modifier(MirrorModifierData *mmd,
|
|
const Mesh *mesh,
|
|
int axis,
|
|
const float plane_co[3],
|
|
float plane_no[3])
|
|
{
|
|
bool do_bisect_flip_axis = ((axis == 0 && mmd->flag & MOD_MIR_BISECT_FLIP_AXIS_X) ||
|
|
(axis == 1 && mmd->flag & MOD_MIR_BISECT_FLIP_AXIS_Y) ||
|
|
(axis == 2 && mmd->flag & MOD_MIR_BISECT_FLIP_AXIS_Z));
|
|
|
|
const float bisect_distance = mmd->bisect_threshold;
|
|
|
|
Mesh *result;
|
|
BMesh *bm;
|
|
BMIter viter;
|
|
BMVert *v, *v_next;
|
|
|
|
BMeshCreateParams bmesh_create_params{false};
|
|
|
|
BMeshFromMeshParams bmesh_from_mesh_params{};
|
|
bmesh_from_mesh_params.calc_face_normal = true;
|
|
bmesh_from_mesh_params.calc_vert_normal = true;
|
|
bmesh_from_mesh_params.cd_mask_extra.vmask = CD_MASK_ORIGINDEX;
|
|
bmesh_from_mesh_params.cd_mask_extra.emask = CD_MASK_ORIGINDEX;
|
|
bmesh_from_mesh_params.cd_mask_extra.pmask = CD_MASK_ORIGINDEX;
|
|
|
|
bm = BKE_mesh_to_bmesh_ex(mesh, &bmesh_create_params, &bmesh_from_mesh_params);
|
|
|
|
/* Define bisecting plane (aka mirror plane). */
|
|
float plane[4];
|
|
if (!do_bisect_flip_axis) {
|
|
/* That reversed condition is a little weird, but for some reason that's how you keep
|
|
* the part of the mesh which is on the non-mirrored side when flip option is disabled.
|
|
* I think this is the expected behavior. */
|
|
negate_v3(plane_no);
|
|
}
|
|
plane_from_point_normal_v3(plane, plane_co, plane_no);
|
|
|
|
BM_mesh_bisect_plane(bm, plane, true, false, 0, 0, bisect_distance);
|
|
|
|
/* Plane definitions for vert killing. */
|
|
float plane_offset[4];
|
|
copy_v3_v3(plane_offset, plane);
|
|
plane_offset[3] = plane[3] - bisect_distance;
|
|
|
|
/* Delete verts across the mirror plane. */
|
|
BM_ITER_MESH_MUTABLE (v, v_next, &viter, bm, BM_VERTS_OF_MESH) {
|
|
if (plane_point_side_v3(plane_offset, v->co) > 0.0f) {
|
|
BM_vert_kill(bm, v);
|
|
}
|
|
}
|
|
|
|
result = BKE_mesh_from_bmesh_for_eval_nomain(bm, nullptr, mesh);
|
|
BM_mesh_free(bm);
|
|
|
|
return result;
|
|
}
|
|
|
|
void BKE_mesh_mirror_apply_mirror_on_axis(Main *bmain,
|
|
Mesh *mesh,
|
|
const int axis,
|
|
const float dist)
|
|
{
|
|
BMeshCreateParams bmesh_create_params{};
|
|
bmesh_create_params.use_toolflags = true;
|
|
|
|
BMeshFromMeshParams bmesh_from_mesh_params{};
|
|
bmesh_from_mesh_params.calc_face_normal = true;
|
|
bmesh_from_mesh_params.calc_vert_normal = true;
|
|
bmesh_from_mesh_params.cd_mask_extra.vmask = CD_MASK_SHAPEKEY;
|
|
|
|
BMesh *bm = BKE_mesh_to_bmesh_ex(mesh, &bmesh_create_params, &bmesh_from_mesh_params);
|
|
BMO_op_callf(bm,
|
|
(BMO_FLAG_DEFAULTS & ~BMO_FLAG_RESPECT_HIDE),
|
|
"symmetrize input=%avef direction=%i dist=%f use_shapekey=%b",
|
|
axis,
|
|
dist,
|
|
true);
|
|
|
|
BMeshToMeshParams bmesh_to_mesh_params{};
|
|
bmesh_to_mesh_params.calc_object_remap = true;
|
|
|
|
BM_mesh_bm_to_me(bmain, bm, mesh, &bmesh_to_mesh_params);
|
|
BM_mesh_free(bm);
|
|
}
|
|
|
|
Mesh *BKE_mesh_mirror_apply_mirror_on_axis_for_modifier(MirrorModifierData *mmd,
|
|
Object *ob,
|
|
const Mesh *mesh,
|
|
const int axis,
|
|
const bool use_correct_order_on_merge,
|
|
int **r_vert_merge_map,
|
|
int *r_vert_merge_map_len)
|
|
{
|
|
using namespace blender;
|
|
using namespace blender::bke;
|
|
const float tolerance_sq = mmd->tolerance * mmd->tolerance;
|
|
const bool do_vtargetmap = (mmd->flag & MOD_MIR_NO_MERGE) == 0 && r_vert_merge_map != nullptr;
|
|
|
|
const bool do_bisect = ((axis == 0 && mmd->flag & MOD_MIR_BISECT_AXIS_X) ||
|
|
(axis == 1 && mmd->flag & MOD_MIR_BISECT_AXIS_Y) ||
|
|
(axis == 2 && mmd->flag & MOD_MIR_BISECT_AXIS_Z));
|
|
|
|
float mtx[4][4];
|
|
float plane_co[3], plane_no[3];
|
|
int a, totshape;
|
|
int *vtmap_a = nullptr, *vtmap_b = nullptr;
|
|
|
|
/* mtx is the mirror transformation */
|
|
unit_m4(mtx);
|
|
mtx[axis][axis] = -1.0f;
|
|
|
|
Object *mirror_ob = mmd->mirror_ob;
|
|
if (mirror_ob != nullptr) {
|
|
float tmp[4][4];
|
|
float itmp[4][4];
|
|
|
|
/* tmp is a transform from coords relative to the object's own origin,
|
|
* to coords relative to the mirror object origin */
|
|
invert_m4_m4(tmp, mirror_ob->object_to_world().ptr());
|
|
mul_m4_m4m4(tmp, tmp, ob->object_to_world().ptr());
|
|
|
|
/* itmp is the reverse transform back to origin-relative coordinates */
|
|
invert_m4_m4(itmp, tmp);
|
|
|
|
/* combine matrices to get a single matrix that translates coordinates into
|
|
* mirror-object-relative space, does the mirror, and translates back to
|
|
* origin-relative space */
|
|
mul_m4_series(mtx, itmp, mtx, tmp);
|
|
|
|
if (do_bisect) {
|
|
copy_v3_v3(plane_co, itmp[3]);
|
|
copy_v3_v3(plane_no, itmp[axis]);
|
|
|
|
/* Account for non-uniform scale in `ob`, see: #87592. */
|
|
float ob_scale[3] = {
|
|
len_squared_v3(ob->object_to_world().ptr()[0]),
|
|
len_squared_v3(ob->object_to_world().ptr()[1]),
|
|
len_squared_v3(ob->object_to_world().ptr()[2]),
|
|
};
|
|
/* Scale to avoid precision loss with extreme values. */
|
|
const float ob_scale_max = max_fff(UNPACK3(ob_scale));
|
|
if (LIKELY(ob_scale_max != 0.0f)) {
|
|
mul_v3_fl(ob_scale, 1.0f / ob_scale_max);
|
|
mul_v3_v3(plane_no, ob_scale);
|
|
}
|
|
}
|
|
}
|
|
else if (do_bisect) {
|
|
copy_v3_v3(plane_co, mtx[3]);
|
|
/* Need to negate here, since that axis is inverted (for mirror transform). */
|
|
negate_v3_v3(plane_no, mtx[axis]);
|
|
}
|
|
|
|
Mesh *mesh_bisect = nullptr;
|
|
if (do_bisect) {
|
|
mesh_bisect = BKE_mesh_mirror_bisect_on_mirror_plane_for_modifier(
|
|
mmd, mesh, axis, plane_co, plane_no);
|
|
mesh = mesh_bisect;
|
|
}
|
|
|
|
const int src_verts_num = mesh->verts_num;
|
|
const int src_edges_num = mesh->edges_num;
|
|
const blender::OffsetIndices src_faces = mesh->faces();
|
|
const int src_loops_num = mesh->corners_num;
|
|
|
|
Mesh *result = BKE_mesh_new_nomain_from_template(
|
|
mesh, src_verts_num * 2, src_edges_num * 2, src_faces.size() * 2, src_loops_num * 2);
|
|
|
|
/* Copy custom-data to original geometry. */
|
|
CustomData_copy_data(&mesh->vert_data, &result->vert_data, 0, 0, src_verts_num);
|
|
CustomData_copy_data(&mesh->edge_data, &result->edge_data, 0, 0, src_edges_num);
|
|
CustomData_copy_data(&mesh->face_data, &result->face_data, 0, 0, src_faces.size());
|
|
CustomData_copy_data(&mesh->corner_data, &result->corner_data, 0, 0, src_loops_num);
|
|
|
|
/* Copy custom data to mirrored geometry. Loops are copied later. */
|
|
CustomData_copy_data(&mesh->vert_data, &result->vert_data, 0, src_verts_num, src_verts_num);
|
|
CustomData_copy_data(&mesh->edge_data, &result->edge_data, 0, src_edges_num, src_edges_num);
|
|
CustomData_copy_data(
|
|
&mesh->face_data, &result->face_data, 0, src_faces.size(), src_faces.size());
|
|
|
|
if (do_vtargetmap) {
|
|
/* second half is filled with -1 */
|
|
*r_vert_merge_map = MEM_malloc_arrayN<int>(2 * size_t(src_verts_num), "MOD_mirror tarmap");
|
|
|
|
vtmap_a = *r_vert_merge_map;
|
|
vtmap_b = *r_vert_merge_map + src_verts_num;
|
|
|
|
*r_vert_merge_map_len = 0;
|
|
}
|
|
|
|
/* mirror vertex coordinates */
|
|
blender::MutableSpan<blender::float3> positions = result->vert_positions_for_write();
|
|
for (int i = 0; i < src_verts_num; i++) {
|
|
const int vert_index_prev = i;
|
|
const int vert_index = src_verts_num + i;
|
|
mul_m4_v3(mtx, positions[vert_index]);
|
|
|
|
if (do_vtargetmap) {
|
|
/* Compare location of the original and mirrored vertex,
|
|
* to see if they should be mapped for merging.
|
|
*
|
|
* Always merge from the copied into the original vertices so it's possible to
|
|
* generate a 1:1 mapping by scanning vertices from the beginning of the array
|
|
* as is done in #BKE_editmesh_vert_coords_when_deformed. Without this,
|
|
* the coordinates returned will sometimes point to the copied vertex locations, see:
|
|
* #91444.
|
|
*
|
|
* However, such a change also affects non-versionable things like some modifiers binding, so
|
|
* we cannot enforce that behavior on existing modifiers, in which case we keep using the
|
|
* old, incorrect behavior of merging the source vertex into its copy.
|
|
*/
|
|
if (use_correct_order_on_merge) {
|
|
if (UNLIKELY(len_squared_v3v3(positions[vert_index_prev], positions[vert_index]) <
|
|
tolerance_sq))
|
|
{
|
|
*vtmap_b = i;
|
|
(*r_vert_merge_map_len)++;
|
|
|
|
/* average location */
|
|
mid_v3_v3v3(positions[vert_index], positions[vert_index_prev], positions[vert_index]);
|
|
copy_v3_v3(positions[vert_index_prev], positions[vert_index]);
|
|
}
|
|
else {
|
|
*vtmap_b = -1;
|
|
}
|
|
|
|
/* Fill here to avoid 2x loops. */
|
|
*vtmap_a = -1;
|
|
}
|
|
else {
|
|
if (UNLIKELY(len_squared_v3v3(positions[vert_index_prev], positions[vert_index]) <
|
|
tolerance_sq))
|
|
{
|
|
*vtmap_a = src_verts_num + i;
|
|
(*r_vert_merge_map_len)++;
|
|
|
|
/* average location */
|
|
mid_v3_v3v3(positions[vert_index], positions[vert_index_prev], positions[vert_index]);
|
|
copy_v3_v3(positions[vert_index_prev], positions[vert_index]);
|
|
}
|
|
else {
|
|
*vtmap_a = -1;
|
|
}
|
|
|
|
/* Fill here to avoid 2x loops. */
|
|
*vtmap_b = -1;
|
|
}
|
|
|
|
vtmap_a++;
|
|
vtmap_b++;
|
|
}
|
|
}
|
|
|
|
/* handle shape keys */
|
|
totshape = CustomData_number_of_layers(&result->vert_data, CD_SHAPEKEY);
|
|
for (a = 0; a < totshape; a++) {
|
|
float(*cos)[3] = static_cast<float(*)[3]>(
|
|
CustomData_get_layer_n_for_write(&result->vert_data, CD_SHAPEKEY, a, result->verts_num));
|
|
for (int i = src_verts_num; i < result->verts_num; i++) {
|
|
mul_m4_v3(mtx, cos[i]);
|
|
}
|
|
}
|
|
|
|
blender::MutableSpan<blender::int2> result_edges = result->edges_for_write();
|
|
blender::MutableSpan<int> result_face_offsets = result->face_offsets_for_write();
|
|
blender::MutableSpan<int> result_corner_verts = result->corner_verts_for_write();
|
|
blender::MutableSpan<int> result_corner_edges = result->corner_edges_for_write();
|
|
|
|
/* adjust mirrored edge vertex indices */
|
|
for (const int i : result_edges.index_range().drop_front(src_edges_num)) {
|
|
result_edges[i] += src_verts_num;
|
|
}
|
|
|
|
result_face_offsets.take_front(src_faces.size()).copy_from(mesh->face_offsets().drop_back(1));
|
|
for (const int i : src_faces.index_range()) {
|
|
result_face_offsets[src_faces.size() + i] = src_faces[i].start() + src_loops_num;
|
|
}
|
|
const blender::OffsetIndices result_faces = result->faces();
|
|
|
|
/* reverse loop order (normals) */
|
|
for (const int i : src_faces.index_range()) {
|
|
const blender::IndexRange src_face = src_faces[i];
|
|
const int mirror_i = src_faces.size() + i;
|
|
const blender::IndexRange mirror_face = result_faces[mirror_i];
|
|
|
|
/* reverse the loop, but we keep the first vertex in the face the same,
|
|
* to ensure that quads are split the same way as on the other side */
|
|
CustomData_copy_data(
|
|
&mesh->corner_data, &result->corner_data, src_face.start(), mirror_face.start(), 1);
|
|
|
|
for (int j = 1; j < mirror_face.size(); j++) {
|
|
CustomData_copy_data(
|
|
&mesh->corner_data, &result->corner_data, src_face[j], mirror_face.last(j - 1), 1);
|
|
}
|
|
|
|
blender::MutableSpan<int> mirror_face_edges = result_corner_edges.slice(mirror_face);
|
|
const int e = mirror_face_edges.first();
|
|
for (int j = 0; j < mirror_face.size() - 1; j++) {
|
|
mirror_face_edges[j] = mirror_face_edges[j + 1];
|
|
}
|
|
mirror_face_edges.last() = e;
|
|
}
|
|
|
|
/* adjust mirrored loop vertex and edge indices */
|
|
for (const int i : result_corner_verts.index_range().drop_front(src_loops_num)) {
|
|
result_corner_verts[i] += src_verts_num;
|
|
}
|
|
for (const int i : result_corner_edges.index_range().drop_front(src_loops_num)) {
|
|
result_corner_edges[i] += src_edges_num;
|
|
}
|
|
|
|
if (!mesh->runtime->subsurf_optimal_display_edges.is_empty()) {
|
|
const blender::BoundedBitSpan src = mesh->runtime->subsurf_optimal_display_edges;
|
|
result->runtime->subsurf_optimal_display_edges.resize(result->edges_num);
|
|
blender::MutableBoundedBitSpan dst = result->runtime->subsurf_optimal_display_edges;
|
|
dst.take_front(src.size()).copy_from(src);
|
|
dst.take_back(src.size()).copy_from(src);
|
|
}
|
|
|
|
/* handle uvs,
|
|
* let tessface recalc handle updating the MTFace data */
|
|
if (mmd->flag & (MOD_MIR_MIRROR_U | MOD_MIR_MIRROR_V) ||
|
|
(is_zero_v2(mmd->uv_offset_copy) == false))
|
|
{
|
|
const bool do_mirr_u = (mmd->flag & MOD_MIR_MIRROR_U) != 0;
|
|
const bool do_mirr_v = (mmd->flag & MOD_MIR_MIRROR_V) != 0;
|
|
/* If set, flip around center of each tile. */
|
|
const bool do_mirr_udim = (mmd->flag & MOD_MIR_MIRROR_UDIM) != 0;
|
|
|
|
const int totuv = CustomData_number_of_layers(&result->corner_data, CD_PROP_FLOAT2);
|
|
|
|
for (a = 0; a < totuv; a++) {
|
|
float(*dmloopuv)[2] = static_cast<float(*)[2]>(CustomData_get_layer_n_for_write(
|
|
&result->corner_data, CD_PROP_FLOAT2, a, result->corners_num));
|
|
int j = src_loops_num;
|
|
dmloopuv += j; /* second set of loops only */
|
|
for (; j-- > 0; dmloopuv++) {
|
|
if (do_mirr_u) {
|
|
float u = (*dmloopuv)[0];
|
|
if (do_mirr_udim) {
|
|
(*dmloopuv)[0] = ceilf(u) - fmodf(u, 1.0f) + mmd->uv_offset[0];
|
|
}
|
|
else {
|
|
(*dmloopuv)[0] = 1.0f - u + mmd->uv_offset[0];
|
|
}
|
|
}
|
|
if (do_mirr_v) {
|
|
float v = (*dmloopuv)[1];
|
|
if (do_mirr_udim) {
|
|
(*dmloopuv)[1] = ceilf(v) - fmodf(v, 1.0f) + mmd->uv_offset[1];
|
|
}
|
|
else {
|
|
(*dmloopuv)[1] = 1.0f - v + mmd->uv_offset[1];
|
|
}
|
|
}
|
|
(*dmloopuv)[0] += mmd->uv_offset_copy[0];
|
|
(*dmloopuv)[1] += mmd->uv_offset_copy[1];
|
|
}
|
|
}
|
|
}
|
|
|
|
/* handle custom split normals */
|
|
bke::MutableAttributeAccessor attributes = result->attributes_for_write();
|
|
bke::GAttributeWriter custom_normals = attributes.lookup_for_write("custom_normal");
|
|
if (ob->type == OB_MESH && custom_normals && custom_normals.domain == bke::AttrDomain::Corner &&
|
|
custom_normals.varray.type().is<short2>() && result->faces_num > 0)
|
|
{
|
|
blender::Array<blender::float3> corner_normals(result_corner_verts.size());
|
|
MutableVArraySpan clnors(custom_normals.varray.typed<short2>());
|
|
blender::bke::mesh::CornerNormalSpaceArray lnors_spacearr;
|
|
|
|
/* The transform matrix of a normal must be
|
|
* the transpose of inverse of transform matrix of the geometry... */
|
|
float mtx_nor[4][4];
|
|
invert_m4_m4(mtx_nor, mtx);
|
|
transpose_m4(mtx_nor);
|
|
|
|
/* calculate custom normals into corner_normals, then mirror first half into second half */
|
|
const VArraySpan sharp_edges = *attributes.lookup<bool>("sharp_edge", AttrDomain::Edge);
|
|
const VArraySpan sharp_faces = *attributes.lookup<bool>("sharp_face", AttrDomain::Face);
|
|
blender::bke::mesh::normals_calc_corners(result->vert_positions(),
|
|
result_edges,
|
|
result_faces,
|
|
result_corner_verts,
|
|
result_corner_edges,
|
|
result->corner_to_face_map(),
|
|
result->face_normals_true(),
|
|
sharp_edges,
|
|
sharp_faces,
|
|
clnors,
|
|
&lnors_spacearr,
|
|
corner_normals);
|
|
|
|
/* mirroring has to account for loops being reversed in faces in second half */
|
|
for (const int i : src_faces.index_range()) {
|
|
const blender::IndexRange src_face = src_faces[i];
|
|
const int mirror_i = src_faces.size() + i;
|
|
|
|
for (const int j : src_face) {
|
|
int mirrorj = result_faces[mirror_i].start();
|
|
if (j > src_face.start()) {
|
|
mirrorj += result_faces[mirror_i].size() - (j - src_face.start());
|
|
}
|
|
|
|
copy_v3_v3(corner_normals[mirrorj], corner_normals[j]);
|
|
mul_m4_v3(mtx_nor, corner_normals[mirrorj]);
|
|
|
|
const int space_index = lnors_spacearr.corner_space_indices[mirrorj];
|
|
clnors[mirrorj] = blender::bke::mesh::corner_space_custom_normal_to_data(
|
|
lnors_spacearr.spaces[space_index], corner_normals[mirrorj]);
|
|
}
|
|
}
|
|
|
|
clnors.save();
|
|
}
|
|
custom_normals.finish();
|
|
|
|
/* handle vgroup stuff */
|
|
if (BKE_object_supports_vertex_groups(ob)) {
|
|
if ((mmd->flag & MOD_MIR_VGROUP) && CustomData_has_layer(&result->vert_data, CD_MDEFORMVERT)) {
|
|
MDeformVert *dvert = result->deform_verts_for_write().data() + src_verts_num;
|
|
int flip_map_len = 0;
|
|
int *flip_map = BKE_object_defgroup_flip_map(ob, false, &flip_map_len);
|
|
if (flip_map) {
|
|
for (int i = 0; i < src_verts_num; dvert++, i++) {
|
|
/* merged vertices get both groups, others get flipped */
|
|
if (use_correct_order_on_merge && do_vtargetmap &&
|
|
((*r_vert_merge_map)[i + src_verts_num] != -1))
|
|
{
|
|
BKE_defvert_flip_merged(dvert - src_verts_num, flip_map, flip_map_len);
|
|
}
|
|
else if (!use_correct_order_on_merge && do_vtargetmap && ((*r_vert_merge_map)[i] != -1))
|
|
{
|
|
BKE_defvert_flip_merged(dvert, flip_map, flip_map_len);
|
|
}
|
|
else {
|
|
BKE_defvert_flip(dvert, flip_map, flip_map_len);
|
|
}
|
|
}
|
|
|
|
MEM_freeN(flip_map);
|
|
}
|
|
}
|
|
}
|
|
|
|
if (mesh_bisect != nullptr) {
|
|
BKE_id_free(nullptr, mesh_bisect);
|
|
}
|
|
return result;
|
|
}
|