Campbell Barton
c33fb00c28
- could crash if triangulate attempted to create an existing face. - tagging edges to rotate was unreliable, don't do this anymore. now check if edge is in the array passed to the beauty function.
98 lines
2.9 KiB
C
98 lines
2.9 KiB
C
/*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version 2
|
|
* of the License, or (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*
|
|
* Contributor(s): Joseph Eagar
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
/** \file blender/bmesh/tools/bmesh_triangulate.c
|
|
* \ingroup bmesh
|
|
*
|
|
* Triangulate.
|
|
*
|
|
*/
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
#include "BLI_utildefines.h"
|
|
#include "BLI_alloca.h"
|
|
#include "BLI_memarena.h"
|
|
#include "BLI_listbase.h"
|
|
#include "BLI_scanfill.h"
|
|
|
|
#include "bmesh.h"
|
|
|
|
#include "bmesh_triangulate.h" /* own include */
|
|
|
|
/**
|
|
* a version of #BM_face_triangulate that maps to #BMOpSlot
|
|
*/
|
|
static void bm_face_triangulate_mapping(BMesh *bm, BMFace *face, MemArena *sf_arena,
|
|
const int quad_method, const int ngon_method,
|
|
const bool use_tag,
|
|
BMOperator *op, BMOpSlot *slot_facemap_out)
|
|
{
|
|
int faces_array_tot = face->len - 3;
|
|
BMFace **faces_array = BLI_array_alloca(faces_array, faces_array_tot);
|
|
BLI_assert(face->len > 3);
|
|
|
|
BM_face_triangulate(bm, face, faces_array, &faces_array_tot, sf_arena, quad_method, ngon_method, use_tag);
|
|
|
|
if (faces_array_tot) {
|
|
int i;
|
|
BMO_slot_map_elem_insert(op, slot_facemap_out, face, face);
|
|
for (i = 0; i < faces_array_tot; i++) {
|
|
BMO_slot_map_elem_insert(op, slot_facemap_out, faces_array[i], face);
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
void BM_mesh_triangulate(BMesh *bm, const int quad_method, const int ngon_method, const bool tag_only,
|
|
BMOperator *op, BMOpSlot *slot_facemap_out)
|
|
{
|
|
BMIter iter;
|
|
BMFace *face;
|
|
MemArena *sf_arena;
|
|
|
|
sf_arena = BLI_memarena_new(BLI_SCANFILL_ARENA_SIZE, __func__);
|
|
|
|
if (slot_facemap_out) {
|
|
/* same as below but call: bm_face_triangulate_mapping() */
|
|
BM_ITER_MESH (face, &iter, bm, BM_FACES_OF_MESH) {
|
|
if (face->len > 3) {
|
|
if (tag_only == false || BM_elem_flag_test(face, BM_ELEM_TAG)) {
|
|
bm_face_triangulate_mapping(bm, face, sf_arena, quad_method, ngon_method, tag_only,
|
|
op, slot_facemap_out);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
BM_ITER_MESH (face, &iter, bm, BM_FACES_OF_MESH) {
|
|
if (face->len > 3) {
|
|
if (tag_only == false || BM_elem_flag_test(face, BM_ELEM_TAG)) {
|
|
BM_face_triangulate(bm, face, NULL, NULL, sf_arena, quad_method, ngon_method, tag_only);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
BLI_memarena_free(sf_arena);
|
|
}
|