2011-10-24 23:32:24 +00:00
|
|
|
/*
|
2009-05-16 16:18:08 +00:00
|
|
|
* ***** 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*
|
|
|
|
* The Original Code is Copyright (C) 2004 Blender Foundation.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* The Original Code is: all of this file.
|
|
|
|
*
|
|
|
|
* Contributor(s): none yet.
|
|
|
|
*
|
|
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
2009-05-18 08:46:04 +00:00
|
|
|
BMEditMesh_mods.c, UI level access, no geometry changes
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <math.h>
|
|
|
|
|
|
|
|
#include "MEM_guardedalloc.h"
|
|
|
|
|
|
|
|
#include "DNA_mesh_types.h"
|
|
|
|
#include "DNA_material_types.h"
|
|
|
|
#include "DNA_meshdata_types.h"
|
|
|
|
#include "DNA_modifier_types.h"
|
|
|
|
#include "DNA_object_types.h"
|
|
|
|
#include "DNA_texture_types.h"
|
|
|
|
#include "DNA_scene_types.h"
|
|
|
|
#include "DNA_screen_types.h"
|
|
|
|
#include "DNA_space_types.h"
|
|
|
|
#include "DNA_view3d_types.h"
|
|
|
|
|
2011-05-09 04:06:48 +00:00
|
|
|
#include "BLI_utildefines.h"
|
2009-05-16 16:18:08 +00:00
|
|
|
#include "BLI_blenlib.h"
|
2009-11-23 14:41:22 +00:00
|
|
|
#include "BLI_math.h"
|
2009-05-16 16:18:08 +00:00
|
|
|
#include "BLI_rand.h"
|
2009-09-17 23:05:33 +00:00
|
|
|
#include "BLI_array.h"
|
2011-05-01 20:43:54 +00:00
|
|
|
#include "BLI_smallhash.h"
|
2011-09-06 03:32:58 +00:00
|
|
|
#include "BLI_heap.h"
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
#include "BKE_context.h"
|
|
|
|
#include "BKE_displist.h"
|
|
|
|
#include "BKE_depsgraph.h"
|
|
|
|
#include "BKE_DerivedMesh.h"
|
|
|
|
#include "BKE_customdata.h"
|
|
|
|
#include "BKE_global.h"
|
|
|
|
#include "BKE_mesh.h"
|
|
|
|
#include "BKE_material.h"
|
|
|
|
#include "BKE_texture.h"
|
|
|
|
#include "BKE_report.h"
|
|
|
|
#include "BKE_tessmesh.h"
|
2011-02-27 06:19:40 +00:00
|
|
|
#include "BKE_paint.h"
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
#include "IMB_imbuf_types.h"
|
|
|
|
#include "IMB_imbuf.h"
|
|
|
|
|
|
|
|
#include "RE_render_ext.h" /* externtex */
|
|
|
|
|
|
|
|
#include "WM_api.h"
|
|
|
|
#include "WM_types.h"
|
|
|
|
|
|
|
|
#include "RNA_access.h"
|
|
|
|
#include "RNA_define.h"
|
|
|
|
|
|
|
|
#include "ED_mesh.h"
|
|
|
|
#include "ED_screen.h"
|
|
|
|
#include "ED_view3d.h"
|
|
|
|
#include "bmesh.h"
|
|
|
|
|
|
|
|
#include "BIF_gl.h"
|
|
|
|
#include "BIF_glutil.h"
|
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
#include "UI_resources.h"
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
#include "mesh_intern.h"
|
|
|
|
|
|
|
|
#include "BLO_sys_types.h" // for intptr_t support
|
|
|
|
|
|
|
|
/* ****************************** MIRROR **************** */
|
|
|
|
|
2011-05-11 02:14:43 +00:00
|
|
|
static void EDBM_select_mirrored(Object *obedit, BMEditMesh *em)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
BMVert *eve, *v1;
|
2011-02-27 06:19:40 +00:00
|
|
|
BMIter iter;
|
|
|
|
int i;
|
2011-05-10 23:48:09 +00:00
|
|
|
|
|
|
|
i= 0;
|
2011-02-27 06:19:40 +00:00
|
|
|
BM_ITER(eve, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(eve, BM_SELECT) && !BM_TestHFlag(eve, BM_HIDDEN)) {
|
|
|
|
v1= editbmesh_get_x_mirror_vert(obedit, em, eve, eve->co, i);
|
2009-05-16 16:18:08 +00:00
|
|
|
if(v1) {
|
2011-02-27 06:19:40 +00:00
|
|
|
BM_Select(em->bm, eve, 0);
|
|
|
|
BM_Select(em->bm, v1, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
2011-02-27 06:19:40 +00:00
|
|
|
i++;
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
void EDBM_automerge(Scene *scene, Object *obedit, int update)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
2009-10-22 23:22:05 +00:00
|
|
|
BMEditMesh *em;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
if ((scene->toolsettings->automerge) &&
|
2011-05-12 00:20:35 +00:00
|
|
|
(obedit && obedit->type==OB_MESH))
|
2009-10-22 23:22:05 +00:00
|
|
|
{
|
|
|
|
em = ((Mesh*)obedit->data)->edit_btmesh;
|
|
|
|
if (!em)
|
|
|
|
return;
|
|
|
|
|
2011-10-09 03:05:36 +00:00
|
|
|
BMO_CallOpf(em->bm, "automerge verts=%hv dist=%f", BM_SELECT, scene->toolsettings->doublimit);
|
2009-10-22 23:22:05 +00:00
|
|
|
if (update) {
|
2011-02-27 06:19:40 +00:00
|
|
|
DAG_id_tag_update(obedit->data, OB_RECALC_DATA);
|
2009-10-22 23:22:05 +00:00
|
|
|
}
|
|
|
|
}
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ****************************** SELECTION ROUTINES **************** */
|
|
|
|
|
|
|
|
unsigned int bm_solidoffs=0, bm_wireoffs=0, bm_vertoffs=0; /* set in drawobject.c ... for colorindices */
|
|
|
|
|
|
|
|
/* facilities for border select and circle select */
|
|
|
|
static char *selbuf= NULL;
|
|
|
|
|
|
|
|
/* opengl doesn't support concave... */
|
2011-05-13 04:04:53 +00:00
|
|
|
static void draw_triangulated(int mcords[][2], short tot)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
ListBase lb={NULL, NULL};
|
|
|
|
DispList *dl;
|
|
|
|
float *fp;
|
|
|
|
int a;
|
|
|
|
|
|
|
|
/* make displist */
|
|
|
|
dl= MEM_callocN(sizeof(DispList), "poly disp");
|
|
|
|
dl->type= DL_POLY;
|
|
|
|
dl->parts= 1;
|
|
|
|
dl->nr= tot;
|
|
|
|
dl->verts= fp= MEM_callocN(tot*3*sizeof(float), "poly verts");
|
|
|
|
BLI_addtail(&lb, dl);
|
|
|
|
|
|
|
|
for(a=0; a<tot; a++, fp+=3) {
|
|
|
|
fp[0]= (float)mcords[a][0];
|
|
|
|
fp[1]= (float)mcords[a][1];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* do the fill */
|
2010-07-19 04:44:37 +00:00
|
|
|
filldisplist(&lb, &lb, 0);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* do the draw */
|
|
|
|
dl= lb.first; /* filldisplist adds in head of list */
|
|
|
|
if(dl->type==DL_INDEX3) {
|
|
|
|
int *index;
|
|
|
|
|
|
|
|
a= dl->parts;
|
|
|
|
fp= dl->verts;
|
|
|
|
index= dl->index;
|
|
|
|
glBegin(GL_TRIANGLES);
|
|
|
|
while(a--) {
|
|
|
|
glVertex3fv(fp+3*index[0]);
|
|
|
|
glVertex3fv(fp+3*index[1]);
|
|
|
|
glVertex3fv(fp+3*index[2]);
|
|
|
|
index+= 3;
|
|
|
|
}
|
|
|
|
glEnd();
|
|
|
|
}
|
|
|
|
|
|
|
|
freedisplist(&lb);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* reads rect, and builds selection array for quick lookup */
|
|
|
|
/* returns if all is OK */
|
|
|
|
int EDBM_init_backbuf_border(ViewContext *vc, short xmin, short ymin, short xmax, short ymax)
|
|
|
|
{
|
|
|
|
struct ImBuf *buf;
|
|
|
|
unsigned int *dr;
|
|
|
|
int a;
|
|
|
|
|
|
|
|
if(vc->obedit==NULL || vc->v3d->drawtype<OB_SOLID || (vc->v3d->flag & V3D_ZBUF_SELECT)==0) return 0;
|
|
|
|
|
|
|
|
buf= view3d_read_backbuf(vc, xmin, ymin, xmax, ymax);
|
|
|
|
if(buf==NULL) return 0;
|
|
|
|
if(bm_vertoffs==0) return 0;
|
|
|
|
|
|
|
|
dr = buf->rect;
|
|
|
|
|
|
|
|
/* build selection lookup */
|
|
|
|
selbuf= MEM_callocN(bm_vertoffs+1, "selbuf");
|
|
|
|
|
|
|
|
a= (xmax-xmin+1)*(ymax-ymin+1);
|
|
|
|
while(a--) {
|
|
|
|
if(*dr>0 && *dr<=bm_vertoffs)
|
|
|
|
selbuf[*dr]= 1;
|
|
|
|
dr++;
|
|
|
|
}
|
|
|
|
IMB_freeImBuf(buf);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int EDBM_check_backbuf(unsigned int index)
|
|
|
|
{
|
|
|
|
if(selbuf==NULL) return 1;
|
|
|
|
if(index>0 && index<=bm_vertoffs)
|
|
|
|
return selbuf[index];
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void EDBM_free_backbuf(void)
|
|
|
|
{
|
|
|
|
if(selbuf) MEM_freeN(selbuf);
|
|
|
|
selbuf= NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* mcords is a polygon mask
|
|
|
|
- grab backbuffer,
|
|
|
|
- draw with black in backbuffer,
|
|
|
|
- grab again and compare
|
|
|
|
returns 'OK'
|
|
|
|
*/
|
2011-05-13 04:04:53 +00:00
|
|
|
int EDBM_mask_init_backbuf_border(ViewContext *vc, int mcords[][2], short tot, short xmin, short ymin, short xmax, short ymax)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
unsigned int *dr, *drm;
|
|
|
|
struct ImBuf *buf, *bufmask;
|
|
|
|
int a;
|
|
|
|
|
|
|
|
/* method in use for face selecting too */
|
|
|
|
if(vc->obedit==NULL) {
|
2009-08-26 10:27:04 +00:00
|
|
|
if(paint_facesel_test(vc->obact));
|
2011-09-22 16:09:27 +00:00
|
|
|
else if(paint_vertsel_test(vc->obact));
|
2009-05-16 16:18:08 +00:00
|
|
|
else return 0;
|
|
|
|
}
|
|
|
|
else if(vc->v3d->drawtype<OB_SOLID || (vc->v3d->flag & V3D_ZBUF_SELECT)==0) return 0;
|
|
|
|
|
|
|
|
buf= view3d_read_backbuf(vc, xmin, ymin, xmax, ymax);
|
|
|
|
if(buf==NULL) return 0;
|
|
|
|
if(bm_vertoffs==0) return 0;
|
|
|
|
|
|
|
|
dr = buf->rect;
|
|
|
|
|
|
|
|
/* draw the mask */
|
|
|
|
glDisable(GL_DEPTH_TEST);
|
|
|
|
|
|
|
|
glColor3ub(0, 0, 0);
|
|
|
|
|
|
|
|
/* yah, opengl doesn't do concave... tsk! */
|
|
|
|
ED_region_pixelspace(vc->ar);
|
|
|
|
draw_triangulated(mcords, tot);
|
|
|
|
|
|
|
|
glBegin(GL_LINE_LOOP); /* for zero sized masks, lines */
|
2011-05-13 04:04:53 +00:00
|
|
|
for(a=0; a<tot; a++) glVertex2iv(mcords[a]);
|
2009-05-16 16:18:08 +00:00
|
|
|
glEnd();
|
|
|
|
|
|
|
|
glFinish(); /* to be sure readpixels sees mask */
|
|
|
|
|
|
|
|
/* grab mask */
|
|
|
|
bufmask= view3d_read_backbuf(vc, xmin, ymin, xmax, ymax);
|
|
|
|
drm = bufmask->rect;
|
|
|
|
if(bufmask==NULL) return 0; /* only when mem alloc fails, go crash somewhere else! */
|
|
|
|
|
|
|
|
/* build selection lookup */
|
|
|
|
selbuf= MEM_callocN(bm_vertoffs+1, "selbuf");
|
|
|
|
|
|
|
|
a= (xmax-xmin+1)*(ymax-ymin+1);
|
|
|
|
while(a--) {
|
|
|
|
if(*dr>0 && *dr<=bm_vertoffs && *drm==0) selbuf[*dr]= 1;
|
|
|
|
dr++; drm++;
|
|
|
|
}
|
|
|
|
IMB_freeImBuf(buf);
|
|
|
|
IMB_freeImBuf(bufmask);
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/* circle shaped sample area */
|
|
|
|
int EDBM_init_backbuf_circle(ViewContext *vc, short xs, short ys, short rads)
|
|
|
|
{
|
|
|
|
struct ImBuf *buf;
|
|
|
|
unsigned int *dr;
|
|
|
|
short xmin, ymin, xmax, ymax, xc, yc;
|
|
|
|
int radsq;
|
|
|
|
|
|
|
|
/* method in use for face selecting too */
|
|
|
|
if(vc->obedit==NULL) {
|
2009-08-26 10:27:04 +00:00
|
|
|
if(paint_facesel_test(vc->obact));
|
2011-09-22 16:09:27 +00:00
|
|
|
else if(paint_vertsel_test(vc->obact));
|
2009-05-16 16:18:08 +00:00
|
|
|
else return 0;
|
|
|
|
}
|
|
|
|
else if(vc->v3d->drawtype<OB_SOLID || (vc->v3d->flag & V3D_ZBUF_SELECT)==0) return 0;
|
|
|
|
|
|
|
|
xmin= xs-rads; xmax= xs+rads;
|
|
|
|
ymin= ys-rads; ymax= ys+rads;
|
|
|
|
buf= view3d_read_backbuf(vc, xmin, ymin, xmax, ymax);
|
|
|
|
if(bm_vertoffs==0) return 0;
|
|
|
|
if(buf==NULL) return 0;
|
|
|
|
|
|
|
|
dr = buf->rect;
|
|
|
|
|
|
|
|
/* build selection lookup */
|
|
|
|
selbuf= MEM_callocN(bm_vertoffs+1, "selbuf");
|
|
|
|
radsq= rads*rads;
|
|
|
|
for(yc= -rads; yc<=rads; yc++) {
|
|
|
|
for(xc= -rads; xc<=rads; xc++, dr++) {
|
|
|
|
if(xc*xc + yc*yc < radsq) {
|
|
|
|
if(*dr>0 && *dr<=bm_vertoffs) selbuf[*dr]= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
IMB_freeImBuf(buf);
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
static void findnearestvert__doClosest(void *userData, BMVert *eve, int x, int y, int index)
|
|
|
|
{
|
|
|
|
struct { short mval[2], pass, select, strict; int dist, lastIndex, closestIndex; BMVert *closest; } *data = userData;
|
|
|
|
|
|
|
|
if (data->pass==0) {
|
|
|
|
if (index<=data->lastIndex)
|
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
if (index>data->lastIndex)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (data->dist>3) {
|
|
|
|
int temp = abs(data->mval[0] - x) + abs(data->mval[1]- y);
|
|
|
|
if (BM_TestHFlag(eve, BM_SELECT) == data->select) {
|
|
|
|
if (data->strict == 1)
|
|
|
|
return;
|
|
|
|
else
|
|
|
|
temp += 5;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (temp<data->dist) {
|
|
|
|
data->dist = temp;
|
|
|
|
data->closest = eve;
|
|
|
|
data->closestIndex = index;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static unsigned int findnearestvert__backbufIndextest(void *handle, unsigned int index)
|
|
|
|
{
|
2009-05-18 08:46:04 +00:00
|
|
|
BMEditMesh *em= (BMEditMesh *)handle;
|
2009-05-16 16:18:08 +00:00
|
|
|
BMVert *eve = BMIter_AtIndex(em->bm, BM_VERTS_OF_MESH, NULL, index-1);
|
|
|
|
|
|
|
|
if(eve && BM_TestHFlag(eve, BM_SELECT)) return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/**
|
|
|
|
* findnearestvert
|
|
|
|
*
|
|
|
|
* dist (in/out): minimal distance to the nearest and at the end, actual distance
|
|
|
|
* sel: selection bias
|
|
|
|
* if SELECT, selected vertice are given a 5 pixel bias to make them farter than unselect verts
|
|
|
|
* if 0, unselected vertice are given the bias
|
|
|
|
* strict: if 1, the vertice corresponding to the sel parameter are ignored and not just biased
|
|
|
|
*/
|
|
|
|
BMVert *EDBM_findnearestvert(ViewContext *vc, int *dist, short sel, short strict)
|
|
|
|
{
|
|
|
|
if(vc->v3d->drawtype>OB_WIRE && (vc->v3d->flag & V3D_ZBUF_SELECT)){
|
|
|
|
int distance;
|
|
|
|
unsigned int index;
|
|
|
|
BMVert *eve;
|
|
|
|
|
|
|
|
if(strict) index = view3d_sample_backbuf_rect(vc, vc->mval, 50, bm_wireoffs, 0xFFFFFF, &distance, strict, vc->em, findnearestvert__backbufIndextest);
|
|
|
|
else index = view3d_sample_backbuf_rect(vc, vc->mval, 50, bm_wireoffs, 0xFFFFFF, &distance, 0, NULL, NULL);
|
|
|
|
|
|
|
|
eve = BMIter_AtIndex(vc->em->bm, BM_VERTS_OF_MESH, NULL, index-1);
|
|
|
|
|
|
|
|
if(eve && distance < *dist) {
|
|
|
|
*dist = distance;
|
|
|
|
return eve;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct { short mval[2], pass, select, strict; int dist, lastIndex, closestIndex; BMVert *closest; } data;
|
|
|
|
static int lastSelectedIndex=0;
|
|
|
|
static BMVert *lastSelected=NULL;
|
|
|
|
|
|
|
|
if (lastSelected && BMIter_AtIndex(vc->em->bm, BM_VERTS_OF_MESH, NULL, lastSelectedIndex)!=lastSelected) {
|
|
|
|
lastSelectedIndex = 0;
|
|
|
|
lastSelected = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
data.lastIndex = lastSelectedIndex;
|
|
|
|
data.mval[0] = vc->mval[0];
|
|
|
|
data.mval[1] = vc->mval[1];
|
|
|
|
data.select = sel;
|
|
|
|
data.dist = *dist;
|
|
|
|
data.strict = strict;
|
|
|
|
data.closest = NULL;
|
|
|
|
data.closestIndex = 0;
|
|
|
|
|
|
|
|
data.pass = 0;
|
2009-10-22 23:22:05 +00:00
|
|
|
|
|
|
|
ED_view3d_init_mats_rv3d(vc->obedit, vc->rv3d);
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
mesh_foreachScreenVert(vc, findnearestvert__doClosest, &data, 1);
|
|
|
|
|
|
|
|
if (data.dist>3) {
|
|
|
|
data.pass = 1;
|
|
|
|
mesh_foreachScreenVert(vc, findnearestvert__doClosest, &data, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
*dist = data.dist;
|
|
|
|
lastSelected = data.closest;
|
|
|
|
lastSelectedIndex = data.closestIndex;
|
|
|
|
|
|
|
|
return data.closest;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* returns labda for closest distance v1 to line-piece v2-v3 */
|
2011-05-11 02:14:43 +00:00
|
|
|
float labda_PdistVL2Dfl(const float v1[3], const float v2[3], const float v3[3])
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
float rc[2], len;
|
|
|
|
|
|
|
|
rc[0]= v3[0]-v2[0];
|
|
|
|
rc[1]= v3[1]-v2[1];
|
|
|
|
len= rc[0]*rc[0]+ rc[1]*rc[1];
|
|
|
|
if(len==0.0f)
|
|
|
|
return 0.0f;
|
|
|
|
|
|
|
|
return ( rc[0]*(v1[0]-v2[0]) + rc[1]*(v1[1]-v2[1]) )/len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* note; uses v3d, so needs active 3d window */
|
2011-05-07 02:48:14 +00:00
|
|
|
static void findnearestedge__doClosest(void *userData, BMEdge *eed, int x0, int y0, int x1, int y1, int UNUSED(index))
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
struct { ViewContext vc; float mval[2]; int dist; BMEdge *closest; } *data = userData;
|
|
|
|
float v1[2], v2[2];
|
|
|
|
int distance;
|
|
|
|
|
|
|
|
v1[0] = x0;
|
|
|
|
v1[1] = y0;
|
|
|
|
v2[0] = x1;
|
|
|
|
v2[1] = y1;
|
|
|
|
|
2009-11-23 14:41:22 +00:00
|
|
|
distance= dist_to_line_segment_v2(data->mval, v1, v2);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
if(BM_TestHFlag(eed, BM_SELECT)) distance+=5;
|
|
|
|
if(distance < data->dist) {
|
|
|
|
if(data->vc.rv3d->rflag & RV3D_CLIPPING) {
|
|
|
|
float labda= labda_PdistVL2Dfl(data->mval, v1, v2);
|
|
|
|
float vec[3];
|
|
|
|
|
|
|
|
vec[0]= eed->v1->co[0] + labda*(eed->v2->co[0] - eed->v1->co[0]);
|
|
|
|
vec[1]= eed->v1->co[1] + labda*(eed->v2->co[1] - eed->v1->co[1]);
|
|
|
|
vec[2]= eed->v1->co[2] + labda*(eed->v2->co[2] - eed->v1->co[2]);
|
2009-11-23 14:41:22 +00:00
|
|
|
mul_m4_v3(data->vc.obedit->obmat, vec);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2011-05-24 04:35:21 +00:00
|
|
|
if(ED_view3d_test_clipping(data->vc.rv3d, vec, 1)==0) {
|
2009-05-16 16:18:08 +00:00
|
|
|
data->dist = distance;
|
|
|
|
data->closest = eed;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
data->dist = distance;
|
|
|
|
data->closest = eed;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
BMEdge *EDBM_findnearestedge(ViewContext *vc, int *dist)
|
|
|
|
{
|
|
|
|
|
|
|
|
if(vc->v3d->drawtype>OB_WIRE && (vc->v3d->flag & V3D_ZBUF_SELECT)) {
|
|
|
|
int distance;
|
2009-11-09 22:47:55 +00:00
|
|
|
unsigned int index;
|
|
|
|
BMEdge *eed;
|
|
|
|
|
|
|
|
view3d_validate_backbuf(vc);
|
|
|
|
|
|
|
|
index = view3d_sample_backbuf_rect(vc, vc->mval, 50, bm_solidoffs, bm_wireoffs, &distance,0, NULL, NULL);
|
|
|
|
eed = BMIter_AtIndex(vc->em->bm, BM_EDGES_OF_MESH, NULL, index-1);
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
if (eed && distance<*dist) {
|
|
|
|
*dist = distance;
|
|
|
|
return eed;
|
|
|
|
} else {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct { ViewContext vc; float mval[2]; int dist; BMEdge *closest; } data;
|
|
|
|
|
|
|
|
data.vc= *vc;
|
|
|
|
data.mval[0] = vc->mval[0];
|
|
|
|
data.mval[1] = vc->mval[1];
|
|
|
|
data.dist = *dist;
|
|
|
|
data.closest = NULL;
|
2009-10-22 23:22:05 +00:00
|
|
|
ED_view3d_init_mats_rv3d(vc->obedit, vc->rv3d);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
mesh_foreachScreenEdge(vc, findnearestedge__doClosest, &data, 2);
|
|
|
|
|
|
|
|
*dist = data.dist;
|
|
|
|
return data.closest;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static void findnearestface__getDistance(void *userData, BMFace *efa, int x, int y, int UNUSED(index))
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
struct { short mval[2]; int dist; BMFace *toFace; } *data = userData;
|
|
|
|
|
|
|
|
if (efa==data->toFace) {
|
|
|
|
int temp = abs(data->mval[0]-x) + abs(data->mval[1]-y);
|
|
|
|
|
|
|
|
if (temp<data->dist)
|
|
|
|
data->dist = temp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
static void findnearestface__doClosest(void *userData, BMFace *efa, int x, int y, int index)
|
|
|
|
{
|
|
|
|
struct { short mval[2], pass; int dist, lastIndex, closestIndex; BMFace *closest; } *data = userData;
|
|
|
|
|
|
|
|
if (data->pass==0) {
|
|
|
|
if (index<=data->lastIndex)
|
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
if (index>data->lastIndex)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (data->dist>3) {
|
|
|
|
int temp = abs(data->mval[0]-x) + abs(data->mval[1]-y);
|
|
|
|
|
|
|
|
if (temp<data->dist) {
|
|
|
|
data->dist = temp;
|
|
|
|
data->closest = efa;
|
|
|
|
data->closestIndex = index;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-09-16 17:43:09 +00:00
|
|
|
|
|
|
|
BMFace *EDBM_findnearestface(ViewContext *vc, int *dist)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
if(vc->v3d->drawtype>OB_WIRE && (vc->v3d->flag & V3D_ZBUF_SELECT)) {
|
2010-09-25 01:54:58 +00:00
|
|
|
unsigned int index;
|
|
|
|
BMFace *efa;
|
|
|
|
|
|
|
|
view3d_validate_backbuf(vc);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2010-09-25 01:54:58 +00:00
|
|
|
index = view3d_sample_backbuf(vc, vc->mval[0], vc->mval[1]);
|
|
|
|
efa = BMIter_AtIndex(vc->em->bm, BM_FACES_OF_MESH, NULL, index-1);
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
if (efa) {
|
|
|
|
struct { short mval[2]; int dist; BMFace *toFace; } data;
|
|
|
|
|
|
|
|
data.mval[0] = vc->mval[0];
|
|
|
|
data.mval[1] = vc->mval[1];
|
|
|
|
data.dist = 0x7FFF; /* largest short */
|
|
|
|
data.toFace = efa;
|
|
|
|
|
|
|
|
mesh_foreachScreenFace(vc, findnearestface__getDistance, &data);
|
|
|
|
|
|
|
|
if(vc->em->selectmode == SCE_SELECT_FACE || data.dist<*dist) { /* only faces, no dist check */
|
|
|
|
*dist= data.dist;
|
|
|
|
return efa;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct { short mval[2], pass; int dist, lastIndex, closestIndex; BMFace *closest; } data;
|
|
|
|
static int lastSelectedIndex=0;
|
|
|
|
static BMFace *lastSelected=NULL;
|
|
|
|
|
|
|
|
if (lastSelected && BMIter_AtIndex(vc->em->bm, BM_FACES_OF_MESH, NULL, lastSelectedIndex)!=lastSelected) {
|
|
|
|
lastSelectedIndex = 0;
|
|
|
|
lastSelected = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
data.lastIndex = lastSelectedIndex;
|
|
|
|
data.mval[0] = vc->mval[0];
|
|
|
|
data.mval[1] = vc->mval[1];
|
|
|
|
data.dist = *dist;
|
|
|
|
data.closest = NULL;
|
|
|
|
data.closestIndex = 0;
|
2009-10-22 23:22:05 +00:00
|
|
|
ED_view3d_init_mats_rv3d(vc->obedit, vc->rv3d);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
data.pass = 0;
|
|
|
|
mesh_foreachScreenFace(vc, findnearestface__doClosest, &data);
|
|
|
|
|
|
|
|
if (data.dist>3) {
|
|
|
|
data.pass = 1;
|
2009-10-22 23:22:05 +00:00
|
|
|
ED_view3d_init_mats_rv3d(vc->obedit, vc->rv3d);
|
2009-05-16 16:18:08 +00:00
|
|
|
mesh_foreachScreenFace(vc, findnearestface__doClosest, &data);
|
|
|
|
}
|
|
|
|
|
|
|
|
*dist = data.dist;
|
|
|
|
lastSelected = data.closest;
|
|
|
|
lastSelectedIndex = data.closestIndex;
|
|
|
|
|
|
|
|
return data.closest;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* best distance based on screen coords.
|
|
|
|
use em->selectmode to define how to use
|
|
|
|
selected vertices and edges get disadvantage
|
|
|
|
return 1 if found one
|
|
|
|
*/
|
|
|
|
static int unified_findnearest(ViewContext *vc, BMVert **eve, BMEdge **eed, BMFace **efa)
|
|
|
|
{
|
2009-05-18 08:46:04 +00:00
|
|
|
BMEditMesh *em= vc->em;
|
2009-05-16 16:18:08 +00:00
|
|
|
int dist= 75;
|
|
|
|
|
|
|
|
*eve= NULL;
|
|
|
|
*eed= NULL;
|
|
|
|
*efa= NULL;
|
|
|
|
|
|
|
|
/* no afterqueue (yet), so we check it now, otherwise the em_xxxofs indices are bad */
|
|
|
|
view3d_validate_backbuf(vc);
|
|
|
|
|
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX)
|
2009-05-18 10:29:37 +00:00
|
|
|
*eve= EDBM_findnearestvert(vc, &dist, BM_SELECT, 0);
|
2009-05-16 16:18:08 +00:00
|
|
|
if(em->selectmode & SCE_SELECT_FACE)
|
|
|
|
*efa= EDBM_findnearestface(vc, &dist);
|
|
|
|
|
|
|
|
dist-= 20; /* since edges select lines, we give dots advantage of 20 pix */
|
|
|
|
if(em->selectmode & SCE_SELECT_EDGE)
|
|
|
|
*eed= EDBM_findnearestedge(vc, &dist);
|
|
|
|
|
|
|
|
/* return only one of 3 pointers, for frontbuffer redraws */
|
|
|
|
if(*eed) {
|
|
|
|
*efa= NULL; *eve= NULL;
|
|
|
|
}
|
|
|
|
else if(*efa) {
|
|
|
|
*eve= NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (*eve || *eed || *efa);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* **************** SIMILAR "group" SELECTS. FACE, EDGE AND VERTEX ************** */
|
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
static EnumPropertyItem prop_similar_types[] = {
|
|
|
|
{SIMVERT_NORMAL, "NORMAL", 0, "Normal", ""},
|
|
|
|
{SIMVERT_FACE, "FACE", 0, "Amount of Adjacent Faces", ""},
|
|
|
|
{SIMVERT_VGROUP, "VGROUP", 0, "Vertex Groups", ""},
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
{SIMEDGE_LENGTH, "LENGTH", 0, "Length", ""},
|
|
|
|
{SIMEDGE_DIR, "DIR", 0, "Direction", ""},
|
|
|
|
{SIMEDGE_FACE, "FACE", 0, "Amount of Faces Around an Edge", ""},
|
|
|
|
{SIMEDGE_FACE_ANGLE, "FACE_ANGLE", 0, "Face Angles", ""},
|
|
|
|
{SIMEDGE_CREASE, "CREASE", 0, "Crease", ""},
|
|
|
|
{SIMEDGE_SEAM, "SEAM", 0, "Seam", ""},
|
|
|
|
{SIMEDGE_SHARP, "SHARP", 0, "Sharpness", ""},
|
2009-08-18 20:05:08 +00:00
|
|
|
|
|
|
|
{SIMFACE_MATERIAL, "MATERIAL", 0, "Material", ""},
|
|
|
|
{SIMFACE_IMAGE, "IMAGE", 0, "Image", ""},
|
|
|
|
{SIMFACE_AREA, "AREA", 0, "Area", ""},
|
|
|
|
{SIMFACE_PERIMETER, "PERIMETER", 0, "Perimeter", ""},
|
|
|
|
{SIMFACE_NORMAL, "NORMAL", 0, "Normal", ""},
|
|
|
|
{SIMFACE_COPLANAR, "COPLANAR", 0, "Co-planar", ""},
|
2009-10-22 23:22:05 +00:00
|
|
|
|
2009-07-16 06:27:37 +00:00
|
|
|
{0, NULL, 0, NULL, NULL}
|
2009-05-16 16:18:08 +00:00
|
|
|
};
|
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
/* selects new faces/edges/verts based on the existing selection */
|
|
|
|
|
2009-08-22 04:45:19 +00:00
|
|
|
static int similar_face_select_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *ob = CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em = ((Mesh*)ob->data)->edit_btmesh;
|
|
|
|
BMOperator bmop;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-08-22 04:45:19 +00:00
|
|
|
/* get the type from RNA */
|
|
|
|
int type = RNA_enum_get(op->ptr, "type");
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
float thresh = CTX_data_tool_settings(C)->select_thresh;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-08-22 04:45:19 +00:00
|
|
|
/* initialize the bmop using EDBM api, which does various ui error reporting and other stuff */
|
|
|
|
EDBM_InitOpf(em, &bmop, op, "similarfaces faces=%hf type=%d thresh=%f", BM_SELECT, type, thresh);
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-08-22 04:45:19 +00:00
|
|
|
/* execute the operator */
|
|
|
|
BMO_Exec_Op(em->bm, &bmop);
|
|
|
|
|
|
|
|
/* clear the existing selection */
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
|
|
|
|
|
|
|
/* select the output */
|
|
|
|
BMO_HeaderFlag_Buffer(em->bm, &bmop, "faceout", BM_SELECT, BM_ALL);
|
|
|
|
|
|
|
|
/* finish the operator */
|
|
|
|
if( !EDBM_FinishOp(em, &bmop, op, 1) )
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
|
|
|
|
/* dependencies graph and notification stuff */
|
2011-02-27 06:19:40 +00:00
|
|
|
DAG_id_tag_update(ob->data, OB_RECALC_DATA);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, ob->data);
|
2009-08-22 04:45:19 +00:00
|
|
|
|
|
|
|
/* we succeeded */
|
|
|
|
return OPERATOR_FINISHED;
|
2009-08-18 20:05:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ***************************************************** */
|
|
|
|
|
|
|
|
/* EDGE GROUP */
|
|
|
|
|
|
|
|
/* wrap the above function but do selection flushing edge to face */
|
|
|
|
static int similar_edge_select_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
2009-08-28 09:36:31 +00:00
|
|
|
Object *ob = CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em = ((Mesh*)ob->data)->edit_btmesh;
|
|
|
|
BMOperator bmop;
|
|
|
|
|
|
|
|
/* get the type from RNA */
|
|
|
|
int type = RNA_enum_get(op->ptr, "type");
|
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
float thresh = CTX_data_tool_settings(C)->select_thresh;
|
2009-08-28 09:36:31 +00:00
|
|
|
|
|
|
|
/* initialize the bmop using EDBM api, which does various ui error reporting and other stuff */
|
|
|
|
EDBM_InitOpf(em, &bmop, op, "similaredges edges=%he type=%d thresh=%f", BM_SELECT, type, thresh);
|
|
|
|
|
|
|
|
/* execute the operator */
|
|
|
|
BMO_Exec_Op(em->bm, &bmop);
|
|
|
|
|
|
|
|
/* clear the existing selection */
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
|
|
|
|
|
|
|
/* select the output */
|
|
|
|
BMO_HeaderFlag_Buffer(em->bm, &bmop, "edgeout", BM_SELECT, BM_ALL);
|
2009-08-28 10:17:31 +00:00
|
|
|
EDBM_selectmode_flush(em);
|
2009-08-28 09:36:31 +00:00
|
|
|
|
|
|
|
/* finish the operator */
|
|
|
|
if( !EDBM_FinishOp(em, &bmop, op, 1) )
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
|
|
|
|
/* dependencies graph and notification stuff */
|
2011-02-27 06:19:40 +00:00
|
|
|
DAG_id_tag_update(ob->data, OB_RECALC_DATA);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, ob->data);
|
2009-08-28 09:36:31 +00:00
|
|
|
|
|
|
|
/* we succeeded */
|
|
|
|
return OPERATOR_FINISHED;
|
2009-08-18 20:05:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ********************************* */
|
|
|
|
|
|
|
|
/*
|
|
|
|
VERT GROUP
|
|
|
|
mode 1: same normal
|
|
|
|
mode 2: same number of face users
|
|
|
|
mode 3: same vertex groups
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
static int similar_vert_select_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
2009-08-28 10:59:16 +00:00
|
|
|
Object *ob = CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em = ((Mesh*)ob->data)->edit_btmesh;
|
|
|
|
BMOperator bmop;
|
|
|
|
/* get the type from RNA */
|
|
|
|
int type = RNA_enum_get(op->ptr, "type");
|
2009-09-16 17:43:09 +00:00
|
|
|
float thresh = CTX_data_tool_settings(C)->select_thresh;
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-08-28 10:59:16 +00:00
|
|
|
/* initialize the bmop using EDBM api, which does various ui error reporting and other stuff */
|
|
|
|
EDBM_InitOpf(em, &bmop, op, "similarverts verts=%hv type=%d thresh=%f", BM_SELECT, type, thresh);
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-08-28 10:59:16 +00:00
|
|
|
/* execute the operator */
|
|
|
|
BMO_Exec_Op(em->bm, &bmop);
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-08-28 10:59:16 +00:00
|
|
|
/* clear the existing selection */
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-08-28 10:59:16 +00:00
|
|
|
/* select the output */
|
|
|
|
BMO_HeaderFlag_Buffer(em->bm, &bmop, "vertout", BM_SELECT, BM_ALL);
|
|
|
|
|
|
|
|
/* finish the operator */
|
|
|
|
if( !EDBM_FinishOp(em, &bmop, op, 1) )
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
|
|
|
|
/* dependencies graph and notification stuff */
|
2011-02-27 06:19:40 +00:00
|
|
|
DAG_id_tag_update(ob->data, OB_RECALC_DATA);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, ob->data);
|
2009-08-28 10:59:16 +00:00
|
|
|
|
|
|
|
/* we succeeded */
|
|
|
|
return OPERATOR_FINISHED;
|
2009-08-18 20:05:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int select_similar_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
int type= RNA_enum_get(op->ptr, "type");
|
|
|
|
|
|
|
|
if(type < 100)
|
|
|
|
return similar_vert_select_exec(C, op);
|
|
|
|
else if(type < 200)
|
|
|
|
return similar_edge_select_exec(C, op);
|
|
|
|
else
|
|
|
|
return similar_face_select_exec(C, op);
|
|
|
|
}
|
|
|
|
|
2011-05-31 05:11:04 +00:00
|
|
|
static EnumPropertyItem *select_similar_type_itemf(bContext *C, PointerRNA *UNUSED(ptr), PropertyRNA *UNUSED(prop), int *free)
|
2009-08-18 20:05:08 +00:00
|
|
|
{
|
2009-10-22 23:22:05 +00:00
|
|
|
Object *obedit = CTX_data_edit_object(C);
|
2011-09-07 06:49:20 +00:00
|
|
|
|
2009-08-18 20:05:08 +00:00
|
|
|
if(obedit && obedit->type == OB_MESH) {
|
2011-09-07 06:49:20 +00:00
|
|
|
EnumPropertyItem *item= NULL;
|
|
|
|
int a, totitem= 0;
|
2009-08-18 20:15:20 +00:00
|
|
|
BMEditMesh *em= ((Mesh*)obedit->data)->edit_btmesh;
|
2009-08-18 20:05:08 +00:00
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
for (a=SIMVERT_NORMAL; a<SIMEDGE_LENGTH; a++) {
|
|
|
|
RNA_enum_items_add_value(&item, &totitem, prop_similar_types, a);
|
|
|
|
}
|
|
|
|
} else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
for (a=SIMEDGE_LENGTH; a<SIMFACE_MATERIAL; a++) {
|
|
|
|
RNA_enum_items_add_value(&item, &totitem, prop_similar_types, a);
|
|
|
|
}
|
|
|
|
} else if(em->selectmode & SCE_SELECT_FACE) {
|
|
|
|
for (a=SIMFACE_MATERIAL; a<=SIMFACE_COPLANAR; a++) {
|
|
|
|
RNA_enum_items_add_value(&item, &totitem, prop_similar_types, a);
|
|
|
|
}
|
|
|
|
}
|
2009-08-18 20:05:08 +00:00
|
|
|
RNA_enum_item_end(&item, &totitem);
|
|
|
|
|
|
|
|
*free= 1;
|
|
|
|
|
|
|
|
return item;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_similar(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
PropertyRNA *prop;
|
|
|
|
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Similar";
|
|
|
|
ot->idname= "MESH_OT_select_similar";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->invoke= WM_menu_invoke;
|
|
|
|
ot->exec= select_similar_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select similar vertices, edges or faces by property types";
|
2009-08-18 20:05:08 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* properties */
|
2011-04-15 02:18:24 +00:00
|
|
|
prop= ot->prop= RNA_def_enum(ot->srna, "type", prop_similar_types, SIMVERT_NORMAL, "Type", "");
|
2009-08-18 20:05:08 +00:00
|
|
|
RNA_def_enum_funcs(prop, select_similar_type_itemf);
|
|
|
|
}
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
/* ***************************************************** */
|
|
|
|
|
|
|
|
/* **************** LOOP SELECTS *************** */
|
2009-07-29 00:43:05 +00:00
|
|
|
|
2009-06-16 21:33:12 +00:00
|
|
|
static void walker_select(BMEditMesh *em, int walkercode, void *start, int select)
|
2009-06-16 20:33:13 +00:00
|
|
|
{
|
|
|
|
BMesh *bm = em->bm;
|
|
|
|
BMHeader *h;
|
|
|
|
BMWalker walker;
|
|
|
|
|
2011-11-24 01:07:36 +00:00
|
|
|
BMW_Init(&walker, bm, walkercode, 0,0,0,0, BMW_NIL_LAY);
|
2009-06-16 20:33:13 +00:00
|
|
|
h = BMW_Begin(&walker, start);
|
|
|
|
for (; h; h=BMW_Step(&walker)) {
|
2011-09-26 03:38:30 +00:00
|
|
|
if (!select)
|
2011-09-13 13:41:20 +00:00
|
|
|
BM_remove_selection(bm, h);
|
2009-06-16 20:33:13 +00:00
|
|
|
BM_Select(bm, h, select);
|
|
|
|
}
|
|
|
|
BMW_End(&walker);
|
|
|
|
}
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2011-06-26 01:11:03 +00:00
|
|
|
static int loop_multiselect(bContext *C, wmOperator *op)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
2011-06-26 01:11:03 +00:00
|
|
|
BMEditMesh *em = ((Mesh*)obedit->data)->edit_btmesh;
|
2009-05-16 16:18:08 +00:00
|
|
|
BMEdge *eed;
|
|
|
|
BMEdge **edarray;
|
2011-06-26 01:11:03 +00:00
|
|
|
int edindex;
|
2009-05-16 16:18:08 +00:00
|
|
|
int looptype= RNA_boolean_get(op->ptr, "ring");
|
|
|
|
|
2011-06-26 01:11:03 +00:00
|
|
|
BMIter iter;
|
|
|
|
int totedgesel = 0;
|
|
|
|
|
|
|
|
for(eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
|
|
|
eed; eed = BMIter_Step(&iter)){
|
|
|
|
|
|
|
|
if(BM_TestHFlag(eed, BM_SELECT)){
|
|
|
|
totedgesel++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2011-06-26 01:11:03 +00:00
|
|
|
edarray = MEM_mallocN(sizeof(BMEdge*)*totedgesel,"edge array");
|
2009-05-16 16:18:08 +00:00
|
|
|
edindex = 0;
|
|
|
|
|
2011-06-26 01:11:03 +00:00
|
|
|
for(eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
|
|
|
eed; eed = BMIter_Step(&iter)){
|
|
|
|
|
|
|
|
if(BM_TestHFlag(eed, BM_SELECT)){
|
2009-05-16 16:18:08 +00:00
|
|
|
edarray[edindex] = eed;
|
2011-06-26 01:11:03 +00:00
|
|
|
edindex++;
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(looptype){
|
2011-06-26 01:11:03 +00:00
|
|
|
for(edindex = 0; edindex < totedgesel; edindex +=1){
|
2009-05-16 16:18:08 +00:00
|
|
|
eed = edarray[edindex];
|
2011-06-26 01:11:03 +00:00
|
|
|
walker_select(em, BMW_EDGERING, eed, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
2011-06-26 01:11:03 +00:00
|
|
|
EDBM_selectmode_flush(em);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else{
|
2011-06-26 01:11:03 +00:00
|
|
|
for(edindex = 0; edindex < totedgesel; edindex +=1){
|
2009-05-16 16:18:08 +00:00
|
|
|
eed = edarray[edindex];
|
2011-06-26 01:11:03 +00:00
|
|
|
walker_select(em, BMW_LOOP, eed, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
2011-06-26 01:11:03 +00:00
|
|
|
EDBM_selectmode_flush(em);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
MEM_freeN(edarray);
|
|
|
|
// if (EM_texFaceCheck())
|
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-05-18 08:46:04 +00:00
|
|
|
return OPERATOR_FINISHED;
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
2009-05-23 03:24:15 +00:00
|
|
|
void MESH_OT_loop_multi_select(wmOperatorType *ot)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Multi Select Loops";
|
2009-06-16 20:08:40 +00:00
|
|
|
ot->idname= "MESH_OT_loop_multi_select";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= loop_multiselect;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select a loop of connected edges by connection type";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* properties */
|
|
|
|
RNA_def_boolean(ot->srna, "ring", 0, "Ring", "");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* ***************** MAIN MOUSE SELECTION ************** */
|
|
|
|
|
|
|
|
|
|
|
|
/* ***************** loop select (non modal) ************** */
|
|
|
|
|
2011-05-13 04:04:53 +00:00
|
|
|
static void mouse_mesh_loop(bContext *C, int mval[2], short extend, short ring)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
ViewContext vc;
|
2009-05-18 08:46:04 +00:00
|
|
|
BMEditMesh *em;
|
2009-05-16 16:18:08 +00:00
|
|
|
BMEdge *eed;
|
|
|
|
int select= 1;
|
2011-09-26 03:38:30 +00:00
|
|
|
int dist = 50;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
em_setup_viewcontext(C, &vc);
|
|
|
|
vc.mval[0]= mval[0];
|
|
|
|
vc.mval[1]= mval[1];
|
|
|
|
em= vc.em;
|
|
|
|
|
2009-10-22 23:22:05 +00:00
|
|
|
/* no afterqueue (yet), so we check it now, otherwise the bm_xxxofs indices are bad */
|
|
|
|
view3d_validate_backbuf(&vc);
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
eed = EDBM_findnearestedge(&vc, &dist);
|
|
|
|
if (eed) {
|
2009-06-02 07:52:17 +00:00
|
|
|
if(extend==0) EDBM_clear_flag_all(em, BM_SELECT);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
if (BM_TestHFlag(eed, BM_SELECT)==0) {
|
|
|
|
select=1;
|
|
|
|
}
|
|
|
|
else if (extend) {
|
|
|
|
select=0;
|
|
|
|
}
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
if(em->selectmode & SCE_SELECT_FACE) {
|
2009-06-16 21:33:12 +00:00
|
|
|
walker_select(em, BMW_FACELOOP, eed, select);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
if(ring)
|
2009-07-29 00:43:05 +00:00
|
|
|
walker_select(em, BMW_EDGERING, eed, select);
|
2009-05-16 16:18:08 +00:00
|
|
|
else
|
2009-06-16 21:33:12 +00:00
|
|
|
walker_select(em, BMW_LOOP, eed, select);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
if(ring)
|
2009-07-29 00:43:05 +00:00
|
|
|
walker_select(em, BMW_EDGERING, eed, select);
|
2011-09-26 03:38:30 +00:00
|
|
|
|
2011-09-04 14:59:20 +00:00
|
|
|
else
|
2009-06-16 21:33:12 +00:00
|
|
|
walker_select(em, BMW_LOOP, eed, select);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
2009-06-02 07:52:17 +00:00
|
|
|
EDBM_selectmode_flush(em);
|
2009-05-16 16:18:08 +00:00
|
|
|
// if (EM_texFaceCheck())
|
|
|
|
|
2010-01-05 22:33:41 +00:00
|
|
|
/* sets as active, useful for other tools */
|
2011-09-26 03:38:30 +00:00
|
|
|
if (select) {
|
|
|
|
if (em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
/* TODO: would be nice if the edge vertex chosen here
|
|
|
|
was the one closer to the selection pointer, instead
|
|
|
|
of arbitrarily selecting the first one */
|
|
|
|
EDBM_store_selection(em, eed->v1);
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
EDBM_store_selection(em, eed);
|
|
|
|
}
|
|
|
|
/* TODO: would be nice if the nearest face that
|
|
|
|
belongs to the selected edge could be set to
|
|
|
|
active here in face select mode */
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, vc.obedit);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int mesh_select_loop_invoke(bContext *C, wmOperator *op, wmEvent *event)
|
|
|
|
{
|
|
|
|
|
|
|
|
view3d_operator_needs_opengl(C);
|
|
|
|
|
|
|
|
mouse_mesh_loop(C, event->mval, RNA_boolean_get(op->ptr, "extend"),
|
|
|
|
RNA_boolean_get(op->ptr, "ring"));
|
|
|
|
|
|
|
|
/* cannot do tweaks for as long this keymap is after transform map */
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
2009-05-23 03:24:15 +00:00
|
|
|
void MESH_OT_loop_select(wmOperatorType *ot)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Loop Select";
|
2009-06-16 20:08:40 +00:00
|
|
|
ot->idname= "MESH_OT_loop_select";
|
2011-09-07 08:34:15 +00:00
|
|
|
ot->description= "Select a loop";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->invoke= mesh_select_loop_invoke;
|
2011-11-06 15:42:12 +00:00
|
|
|
ot->poll= ED_operator_editmesh_region_view3d;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select a loop of connected edges";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* properties */
|
2011-09-07 08:34:15 +00:00
|
|
|
RNA_def_boolean(ot->srna, "extend", 0, "Extend Select", "Extend the selection");
|
|
|
|
RNA_def_boolean(ot->srna, "ring", 0, "Select Ring", "Select ring");
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_edgering_select (wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* description */
|
|
|
|
ot->name= "Edge Ring Select";
|
|
|
|
ot->idname= "MESH_OT_edgering_select";
|
|
|
|
ot->description= "Select an edge ring";
|
|
|
|
|
|
|
|
/* callbacks */
|
|
|
|
ot->invoke= mesh_select_loop_invoke;
|
2011-11-06 15:42:12 +00:00
|
|
|
ot->poll= ED_operator_editmesh_region_view3d;
|
2011-09-07 08:34:15 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
RNA_def_boolean(ot->srna, "extend", 0, "Extend", "Extend the selection");
|
|
|
|
RNA_def_boolean(ot->srna, "ring", 1, "Select Ring", "Select ring");
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
2011-09-06 03:32:58 +00:00
|
|
|
/* ******************* edgetag_shortest_path and helpers ****************** */
|
|
|
|
|
|
|
|
static float edgetag_cut_cost(BMEditMesh *UNUSED(em), BMEdge *e1, BMEdge *e2, BMVert* v)
|
|
|
|
{
|
|
|
|
BMVert *v1 = (e1->v1 == v) ? e1->v2 : e1->v1;
|
|
|
|
BMVert *v2 = (e2->v1 == v) ? e2->v2 : e2->v1;
|
|
|
|
float cost, d1[3], d2[3];
|
|
|
|
|
|
|
|
/*The cost is based on the simple sum of the length of the two edgees...*/
|
|
|
|
sub_v3_v3v3(d1, v->co, v1->co);
|
|
|
|
sub_v3_v3v3(d2, v2->co, v->co);
|
|
|
|
cost = len_v3(d1);
|
|
|
|
cost += len_v3(d2);
|
|
|
|
|
|
|
|
/*...but is biased to give higher values to sharp turns, so that it will take
|
|
|
|
paths with fewer "turns" when selecting between equal-weighted paths between
|
|
|
|
the two edges*/
|
|
|
|
cost = cost + 0.5f*cost*(2.0f - sqrt(fabs(dot_v3v3(d1, d2))));
|
|
|
|
|
|
|
|
return cost;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void edgetag_add_adjacent(BMEditMesh *em, SmallHash *visithash, Heap *heap, int mednum, int vertnum,
|
|
|
|
int *nedges, int *edges, int *prevedge, float *cost)
|
|
|
|
{
|
|
|
|
BMEdge *e1 = EDBM_get_edge_for_index(em, mednum);
|
|
|
|
BMVert *v = EDBM_get_vert_for_index(em, vertnum);
|
|
|
|
int startadj, endadj = nedges[vertnum+1];
|
|
|
|
|
|
|
|
for (startadj = nedges[vertnum]; startadj < endadj; startadj++) {
|
|
|
|
int adjnum = edges[startadj];
|
|
|
|
BMEdge *e2 = EDBM_get_edge_for_index(em, adjnum);
|
|
|
|
float newcost;
|
|
|
|
float cutcost;
|
|
|
|
|
|
|
|
if (BLI_smallhash_haskey(visithash, (uintptr_t)e2))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
cutcost = edgetag_cut_cost(em, e1, e2, v);
|
|
|
|
newcost = cost[mednum] + cutcost;
|
|
|
|
|
|
|
|
if (cost[adjnum] > newcost) {
|
|
|
|
cost[adjnum] = newcost;
|
|
|
|
prevedge[adjnum] = mednum;
|
|
|
|
BLI_heap_insert(heap, newcost, SET_INT_IN_POINTER(adjnum));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void edgetag_context_set(BMEditMesh *em, Scene *scene, BMEdge *e, int val)
|
|
|
|
{
|
|
|
|
|
|
|
|
switch (scene->toolsettings->edge_mode) {
|
|
|
|
case EDGE_MODE_SELECT:
|
|
|
|
BM_Select(em->bm, e, val);
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_SEAM:
|
|
|
|
if (val) {BM_SetHFlag(e, BM_SEAM);}
|
|
|
|
else {BM_ClearHFlag(e, BM_SEAM);}
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_SHARP:
|
|
|
|
if (val) {BM_SetHFlag(e, BM_SEAM);}
|
|
|
|
else {BM_ClearHFlag(e, BM_SEAM);}
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_CREASE:
|
|
|
|
{
|
|
|
|
float *crease = CustomData_bmesh_get(&em->bm->edata, e->head.data, CD_CREASE);
|
|
|
|
|
|
|
|
if (val) {*crease = 1.0f;}
|
|
|
|
else {*crease = 0.0f;}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case EDGE_MODE_TAG_BEVEL:
|
|
|
|
{
|
|
|
|
float *bweight = CustomData_bmesh_get(&em->bm->edata, e->head.data, CD_BWEIGHT);
|
|
|
|
|
|
|
|
if (val) {*bweight = 1.0f;}
|
|
|
|
else {*bweight = 0.0f;}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static float bm_cdata_get_single_float(BMesh *UNUSED(bm), CustomData *cdata, void *element, int type)
|
|
|
|
{
|
|
|
|
BMHeader *ele = element;
|
|
|
|
float *f;
|
|
|
|
|
|
|
|
if (!CustomData_has_layer(cdata, type))
|
|
|
|
return 0.0f;
|
|
|
|
|
|
|
|
f = CustomData_bmesh_get(cdata, ele->data, type);
|
|
|
|
|
|
|
|
return *f;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int edgetag_context_check(Scene *scene, BMEditMesh *em, BMEdge *e)
|
|
|
|
{
|
|
|
|
switch (scene->toolsettings->edge_mode) {
|
|
|
|
case EDGE_MODE_SELECT:
|
|
|
|
return BM_TestHFlag(e, BM_SELECT) ? 1 : 0;
|
|
|
|
case EDGE_MODE_TAG_SEAM:
|
|
|
|
return BM_TestHFlag(e, BM_SEAM);
|
|
|
|
case EDGE_MODE_TAG_SHARP:
|
|
|
|
return BM_TestHFlag(e, BM_SHARP);
|
|
|
|
case EDGE_MODE_TAG_CREASE:
|
|
|
|
return bm_cdata_get_single_float(em->bm, &em->bm->edata, e, CD_CREASE) ? 1 : 0;
|
|
|
|
case EDGE_MODE_TAG_BEVEL:
|
|
|
|
return bm_cdata_get_single_float(em->bm, &em->bm->edata, e, CD_BWEIGHT) ? 1 : 0;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int edgetag_shortest_path(Scene *scene, BMEditMesh *em, BMEdge *source, BMEdge *target)
|
|
|
|
{
|
|
|
|
BMEdge *e;
|
|
|
|
BMIter iter;
|
|
|
|
Heap *heap;
|
|
|
|
SmallHash visithash;
|
|
|
|
float *cost;
|
|
|
|
int i, totvert=0, totedge=0, *nedges, *edges, *prevedge, mednum = -1, nedgeswap = 0;
|
|
|
|
int targetnum;
|
|
|
|
|
|
|
|
BLI_smallhash_init(&visithash);
|
|
|
|
|
2011-11-16 12:38:40 +00:00
|
|
|
/* note, would pass BM_EDGE except we are looping over all edges anyway */
|
|
|
|
BM_ElemIndex_Ensure(em->bm, BM_VERT /* | BM_EDGE */ );
|
2011-09-06 03:32:58 +00:00
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
e->head.flags[0].f = 0;
|
|
|
|
if (BM_TestHFlag(e, BM_HIDDEN)) {
|
|
|
|
BLI_smallhash_insert(&visithash, (uintptr_t)e, NULL);
|
|
|
|
}
|
2011-11-16 12:38:40 +00:00
|
|
|
|
|
|
|
BM_SetIndex(e, totedge); /* set_inline */
|
2011-09-06 03:32:58 +00:00
|
|
|
totedge++;
|
|
|
|
}
|
2011-11-16 12:38:40 +00:00
|
|
|
em->bm->elem_index_dirty &= ~BM_EDGE;
|
2011-09-06 03:32:58 +00:00
|
|
|
|
|
|
|
/* alloc */
|
|
|
|
nedges = MEM_callocN(sizeof(*nedges)*totvert+1, "SeamPathNEdges");
|
|
|
|
edges = MEM_mallocN(sizeof(*edges)*totedge*2, "SeamPathEdges");
|
|
|
|
prevedge = MEM_mallocN(sizeof(*prevedge)*totedge, "SeamPathPrevious");
|
|
|
|
cost = MEM_mallocN(sizeof(*cost)*totedge, "SeamPathCost");
|
|
|
|
|
|
|
|
/* count edges, compute adjacent edges offsets and fill adjacent */
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
nedges[BM_GetIndex(e->v1)+1]++;
|
|
|
|
nedges[BM_GetIndex(e->v2)+1]++;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 1; i < totvert; i++) {
|
|
|
|
int newswap = nedges[i+1];
|
|
|
|
nedges[i+1] = nedgeswap + nedges[i];
|
|
|
|
nedgeswap = newswap;
|
|
|
|
}
|
|
|
|
nedges[0] = nedges[1] = 0;
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
edges[nedges[BM_GetIndex(e->v1)+1]++] = i;
|
|
|
|
edges[nedges[BM_GetIndex(e->v2)+1]++] = i;
|
|
|
|
|
|
|
|
cost[i] = 1e20f;
|
|
|
|
prevedge[i] = -1;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Arrays are now filled as follows:
|
|
|
|
*
|
|
|
|
* nedges[n] = sum of the # of edges incident to all vertices numbered 0 thru n-1
|
|
|
|
* edges[edges[n]..edges[n-1]] = the indices of of the edges incident to vertex n
|
|
|
|
*
|
|
|
|
* As the search continues, prevedge[n] will be the previous edge on the shortest
|
|
|
|
* path found so far to edge n. The visitedhash will of course contain entries
|
|
|
|
* for edges that have been visited, cost[n] will contain the length of the shortest
|
|
|
|
* path to edge n found so far, Finally, heap is a priority heap which is built on the
|
|
|
|
* the same data as the cost arry, but inverted: it is a worklist of edges prioritized
|
|
|
|
* by the shortest path found so far to the edge.
|
|
|
|
*/
|
|
|
|
|
2011-09-07 06:49:20 +00:00
|
|
|
#if 0 /* UNUSED */ /* this block does nothing, not sure why its here? - campbell */
|
2011-09-06 03:32:58 +00:00
|
|
|
for (i = 0; i < totvert; i++) {
|
|
|
|
int start = nedges[i], end = nedges[i+1], cur;
|
|
|
|
for (cur = start; cur < end; cur++) {
|
|
|
|
BMEdge* e = EDBM_get_edge_for_index(em, edges[cur]);
|
|
|
|
}
|
|
|
|
}
|
2011-09-07 06:49:20 +00:00
|
|
|
#endif
|
2011-09-06 03:32:58 +00:00
|
|
|
|
|
|
|
/* regular dijkstra shortest path, but over edges instead of vertices */
|
|
|
|
heap = BLI_heap_new();
|
|
|
|
BLI_heap_insert(heap, 0.0f, SET_INT_IN_POINTER(BM_GetIndex(source)));
|
|
|
|
cost[BM_GetIndex(source)] = 0.0f;
|
|
|
|
EDBM_init_index_arrays(em, 1, 1, 0);
|
|
|
|
targetnum = BM_GetIndex(target);
|
|
|
|
|
|
|
|
while (!BLI_heap_empty(heap)) {
|
|
|
|
mednum = GET_INT_FROM_POINTER(BLI_heap_popmin(heap));
|
|
|
|
e = EDBM_get_edge_for_index(em, mednum);
|
|
|
|
|
|
|
|
if (mednum == targetnum)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (BLI_smallhash_haskey(&visithash, (uintptr_t)e))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
BLI_smallhash_insert(&visithash, (uintptr_t)e, NULL);
|
|
|
|
|
|
|
|
edgetag_add_adjacent(em, &visithash, heap, mednum, BM_GetIndex(e->v1), nedges, edges, prevedge, cost);
|
|
|
|
edgetag_add_adjacent(em, &visithash, heap, mednum, BM_GetIndex(e->v2), nedges, edges, prevedge, cost);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (mednum == targetnum) {
|
|
|
|
short allseams = 1;
|
|
|
|
|
|
|
|
/*Check whether the path is already completely tagged.
|
|
|
|
if it is, the tags will be cleared instead of set.*/
|
|
|
|
mednum = targetnum;
|
|
|
|
do {
|
|
|
|
e = EDBM_get_edge_for_index(em, mednum);
|
|
|
|
if (!edgetag_context_check(scene, em, e)) {
|
|
|
|
allseams = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
mednum = prevedge[mednum];
|
|
|
|
} while (mednum != BM_GetIndex(source));
|
|
|
|
|
|
|
|
/*Follow path back and source and add or remove tags*/
|
|
|
|
mednum = targetnum;
|
|
|
|
do {
|
|
|
|
e = EDBM_get_edge_for_index(em, mednum);
|
|
|
|
if (allseams)
|
|
|
|
edgetag_context_set(em, scene, e, 0);
|
|
|
|
else
|
|
|
|
edgetag_context_set(em, scene, e, 1);
|
|
|
|
mednum = prevedge[mednum];
|
|
|
|
} while (mednum != -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
EDBM_free_index_arrays(em);
|
|
|
|
MEM_freeN(nedges);
|
|
|
|
MEM_freeN(edges);
|
|
|
|
MEM_freeN(prevedge);
|
|
|
|
MEM_freeN(cost);
|
|
|
|
BLI_heap_free(heap, NULL);
|
|
|
|
BLI_smallhash_release(&visithash);
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2009-05-16 16:18:08 +00:00
|
|
|
/* ******************* mesh shortest path select, uses prev-selected edge ****************** */
|
|
|
|
|
|
|
|
/* since you want to create paths with multiple selects, it doesn't have extend option */
|
2011-09-06 03:32:58 +00:00
|
|
|
static void mouse_mesh_shortest_path(bContext *C, int mval[2])
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
2011-09-06 03:32:58 +00:00
|
|
|
Object *ob = CTX_data_edit_object(C);
|
2009-05-16 16:18:08 +00:00
|
|
|
ViewContext vc;
|
2009-05-18 08:46:04 +00:00
|
|
|
BMEditMesh *em;
|
2011-09-06 03:32:58 +00:00
|
|
|
BMEdge *e;
|
2009-05-16 16:18:08 +00:00
|
|
|
int dist= 50;
|
|
|
|
|
|
|
|
em_setup_viewcontext(C, &vc);
|
|
|
|
vc.mval[0]= mval[0];
|
|
|
|
vc.mval[1]= mval[1];
|
|
|
|
em= vc.em;
|
|
|
|
|
2011-09-06 03:32:58 +00:00
|
|
|
e= EDBM_findnearestedge(&vc, &dist);
|
|
|
|
if(e) {
|
2009-05-16 16:18:08 +00:00
|
|
|
Mesh *me= vc.obedit->data;
|
|
|
|
int path = 0;
|
|
|
|
|
2009-07-17 10:54:00 +00:00
|
|
|
if (em->bm->selected.last) {
|
2011-11-01 14:36:23 +00:00
|
|
|
BMEditSelection *ese= em->bm->selected.last;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2011-11-01 14:36:23 +00:00
|
|
|
if(ese && ese->htype == BM_EDGE) {
|
2011-09-06 03:32:58 +00:00
|
|
|
BMEdge *e_act;
|
2011-11-01 14:36:23 +00:00
|
|
|
e_act = (BMEdge *)ese->data;
|
2011-09-06 03:32:58 +00:00
|
|
|
if (e_act != e) {
|
|
|
|
if (edgetag_shortest_path(vc.scene, em, e_act, e)) {
|
|
|
|
EDBM_remove_selection(em, e_act);
|
2009-05-16 16:18:08 +00:00
|
|
|
path = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (path==0) {
|
2011-09-06 03:32:58 +00:00
|
|
|
int act = (edgetag_context_check(vc.scene, em, e)==0);
|
|
|
|
edgetag_context_set(em, vc.scene, e, act); /* switch the edge option */
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
2011-09-06 03:32:58 +00:00
|
|
|
EDBM_selectmode_flush(em);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* even if this is selected it may not be in the selection list */
|
2011-09-06 03:32:58 +00:00
|
|
|
if(edgetag_context_check(vc.scene, em, e)==0)
|
|
|
|
EDBM_remove_selection(em, e);
|
2009-05-16 16:18:08 +00:00
|
|
|
else
|
2011-09-06 03:32:58 +00:00
|
|
|
EDBM_store_selection(em, e);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* force drawmode for mesh */
|
2009-09-16 17:43:09 +00:00
|
|
|
switch (CTX_data_tool_settings(C)->edge_mode) {
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
case EDGE_MODE_TAG_SEAM:
|
|
|
|
me->drawflag |= ME_DRAWSEAMS;
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_SHARP:
|
|
|
|
me->drawflag |= ME_DRAWSHARP;
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_CREASE:
|
|
|
|
me->drawflag |= ME_DRAWCREASES;
|
|
|
|
break;
|
|
|
|
case EDGE_MODE_TAG_BEVEL:
|
|
|
|
me->drawflag |= ME_DRAWBWEIGHTS;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-02-27 06:19:40 +00:00
|
|
|
DAG_id_tag_update(ob->data, OB_RECALC_DATA);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, ob->data);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static int mesh_shortest_path_select_invoke(bContext *C, wmOperator *UNUSED(op), wmEvent *event)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
view3d_operator_needs_opengl(C);
|
|
|
|
|
|
|
|
mouse_mesh_shortest_path(C, event->mval);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
2009-05-23 03:24:15 +00:00
|
|
|
void MESH_OT_select_shortest_path(wmOperatorType *ot)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Shortest Path Select";
|
2009-06-16 20:08:40 +00:00
|
|
|
ot->idname= "MESH_OT_select_shortest_path";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->invoke= mesh_shortest_path_select_invoke;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select shortest path between two selections";
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* properties */
|
|
|
|
RNA_def_boolean(ot->srna, "extend", 0, "Extend Select", "");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ************************************************** */
|
|
|
|
/* here actual select happens */
|
|
|
|
/* gets called via generic mouse select operator */
|
2011-05-13 04:04:53 +00:00
|
|
|
int mouse_mesh(bContext *C, const int mval[2], short extend)
|
2009-05-16 16:18:08 +00:00
|
|
|
{
|
|
|
|
ViewContext vc;
|
2009-05-18 08:46:04 +00:00
|
|
|
BMVert *eve = NULL;
|
|
|
|
BMEdge *eed = NULL;
|
|
|
|
BMFace *efa = NULL;
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
/* setup view context for argument to callbacks */
|
|
|
|
em_setup_viewcontext(C, &vc);
|
|
|
|
vc.mval[0]= mval[0];
|
|
|
|
vc.mval[1]= mval[1];
|
|
|
|
|
|
|
|
if(unified_findnearest(&vc, &eve, &eed, &efa)) {
|
|
|
|
|
2009-05-18 08:46:04 +00:00
|
|
|
if(extend==0) EDBM_clear_flag_all(vc.em, BM_SELECT);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
if(efa) {
|
|
|
|
/* set the last selected face */
|
2011-09-13 13:41:20 +00:00
|
|
|
BM_set_actFace(vc.em->bm, efa);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
2009-05-18 08:46:04 +00:00
|
|
|
if(!BM_TestHFlag(efa, BM_SELECT)) {
|
2009-05-16 16:18:08 +00:00
|
|
|
EDBM_store_selection(vc.em, efa);
|
2009-05-18 08:46:04 +00:00
|
|
|
BM_Select(vc.em->bm, efa, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else if(extend) {
|
|
|
|
EDBM_remove_selection(vc.em, efa);
|
2009-08-15 17:31:28 +00:00
|
|
|
BM_Select(vc.em->bm, efa, 0);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(eed) {
|
2009-05-18 10:29:37 +00:00
|
|
|
if(!BM_TestHFlag(eed, BM_SELECT)) {
|
2009-05-16 16:18:08 +00:00
|
|
|
EDBM_store_selection(vc.em, eed);
|
2009-05-18 08:46:04 +00:00
|
|
|
BM_Select(vc.em->bm, eed, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else if(extend) {
|
|
|
|
EDBM_remove_selection(vc.em, eed);
|
2009-05-18 08:46:04 +00:00
|
|
|
BM_Select(vc.em->bm, eed, 0);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(eve) {
|
2009-05-18 08:46:04 +00:00
|
|
|
if(!BM_TestHFlag(eve, BM_SELECT)) {
|
2009-05-16 16:18:08 +00:00
|
|
|
EDBM_store_selection(vc.em, eve);
|
2009-05-18 08:46:04 +00:00
|
|
|
BM_Select(vc.em->bm, eve, 1);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
else if(extend){
|
|
|
|
EDBM_remove_selection(vc.em, eve);
|
2009-05-18 08:46:04 +00:00
|
|
|
BM_Select(vc.em->bm, eve, 0);
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-18 08:46:04 +00:00
|
|
|
EDBM_selectmode_flush(vc.em);
|
2009-05-16 16:18:08 +00:00
|
|
|
|
|
|
|
// if (EM_texFaceCheck()) {
|
|
|
|
|
|
|
|
if (efa && efa->mat_nr != vc.obedit->actcol-1) {
|
|
|
|
vc.obedit->actcol= efa->mat_nr+1;
|
|
|
|
vc.em->mat_nr= efa->mat_nr;
|
|
|
|
// BIF_preview_changed(ID_MA);
|
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, vc.obedit);
|
|
|
|
return 1;
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
|
|
|
|
2010-01-05 22:33:41 +00:00
|
|
|
return 0;
|
2009-05-16 16:18:08 +00:00
|
|
|
}
|
2009-05-28 04:41:02 +00:00
|
|
|
|
|
|
|
static void EDBM_strip_selections(BMEditMesh *em)
|
|
|
|
{
|
|
|
|
BMEditSelection *ese, *nextese;
|
|
|
|
|
|
|
|
if(!(em->selectmode & SCE_SELECT_VERTEX)){
|
2009-07-17 10:54:00 +00:00
|
|
|
ese = em->bm->selected.first;
|
2009-05-28 04:41:02 +00:00
|
|
|
while(ese){
|
|
|
|
nextese = ese->next;
|
2011-11-01 14:36:23 +00:00
|
|
|
if(ese->htype == BM_VERT) BLI_freelinkN(&(em->bm->selected),ese);
|
2009-05-28 04:41:02 +00:00
|
|
|
ese = nextese;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(!(em->selectmode & SCE_SELECT_EDGE)){
|
2009-07-17 10:54:00 +00:00
|
|
|
ese=em->bm->selected.first;
|
2009-05-28 04:41:02 +00:00
|
|
|
while(ese){
|
|
|
|
nextese = ese->next;
|
2011-11-01 14:36:23 +00:00
|
|
|
if(ese->htype == BM_EDGE) BLI_freelinkN(&(em->bm->selected), ese);
|
2009-05-28 04:41:02 +00:00
|
|
|
ese = nextese;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(!(em->selectmode & SCE_SELECT_FACE)){
|
2009-07-17 10:54:00 +00:00
|
|
|
ese=em->bm->selected.first;
|
2009-05-28 04:41:02 +00:00
|
|
|
while(ese){
|
|
|
|
nextese = ese->next;
|
2011-11-01 14:36:23 +00:00
|
|
|
if(ese->htype == BM_FACE) BLI_freelinkN(&(em->bm->selected), ese);
|
2009-05-28 04:41:02 +00:00
|
|
|
ese = nextese;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* when switching select mode, makes sure selection is consistant for editing */
|
|
|
|
/* also for paranoia checks to make sure edge or face mode works */
|
|
|
|
void EDBM_selectmode_set(BMEditMesh *em)
|
|
|
|
{
|
|
|
|
BMVert *eve;
|
|
|
|
BMEdge *eed;
|
|
|
|
BMFace *efa;
|
|
|
|
BMIter iter;
|
|
|
|
|
|
|
|
em->bm->selectmode = em->selectmode;
|
|
|
|
|
|
|
|
EDBM_strip_selections(em); /*strip BMEditSelections from em->selected that are not relevant to new mode*/
|
|
|
|
|
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX) {
|
2009-08-26 10:27:04 +00:00
|
|
|
/*BMIter iter;
|
2009-05-28 04:41:02 +00:00
|
|
|
|
2009-08-26 10:27:04 +00:00
|
|
|
eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
2009-05-28 04:41:02 +00:00
|
|
|
for ( ; eed; eed=BMIter_Step(&iter)) BM_Select(em->bm, eed, 0);
|
|
|
|
|
|
|
|
efa = BMIter_New(&iter, em->bm, BM_FACES_OF_MESH, NULL);
|
2009-06-18 10:15:23 +00:00
|
|
|
for ( ; efa; efa=BMIter_Step(&iter)) BM_Select(em->bm, efa, 0);*/
|
2009-05-28 04:41:02 +00:00
|
|
|
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
/* deselect vertices, and select again based on edge select */
|
|
|
|
eve = BMIter_New(&iter, em->bm, BM_VERTS_OF_MESH, NULL);
|
|
|
|
for ( ; eve; eve=BMIter_Step(&iter)) BM_Select(em->bm, eve, 0);
|
|
|
|
|
|
|
|
eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
|
|
|
for ( ; eed; eed=BMIter_Step(&iter)) {
|
|
|
|
if (BM_TestHFlag(eed, BM_SELECT))
|
|
|
|
BM_Select(em->bm, eed, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* selects faces based on edge status */
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_FACE) {
|
|
|
|
/* deselect eges, and select again based on face select */
|
|
|
|
eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
|
|
|
for ( ; eed; eed=BMIter_Step(&iter)) BM_Select(em->bm, eed, 0);
|
|
|
|
|
|
|
|
efa = BMIter_New(&iter, em->bm, BM_FACES_OF_MESH, NULL);
|
|
|
|
for ( ; efa; efa=BMIter_Step(&iter)) {
|
|
|
|
if (BM_TestHFlag(efa, BM_SELECT))
|
|
|
|
BM_Select(em->bm, efa, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void EDBM_convertsel(BMEditMesh *em, short oldmode, short selectmode)
|
|
|
|
{
|
|
|
|
BMEdge *eed;
|
|
|
|
BMFace *efa;
|
|
|
|
BMIter iter;
|
|
|
|
|
|
|
|
/*have to find out what the selectionmode was previously*/
|
|
|
|
if(oldmode == SCE_SELECT_VERTEX) {
|
|
|
|
if(selectmode == SCE_SELECT_EDGE) {
|
|
|
|
/*select all edges associated with every selected vertex*/
|
|
|
|
eed = BMIter_New(&iter, em->bm, BM_EDGES_OF_MESH, NULL);
|
|
|
|
for ( ; eed; eed=BMIter_Step(&iter)) {
|
|
|
|
if(BM_TestHFlag(eed->v1, BM_SELECT)) BM_Select(em->bm, eed, 1);
|
|
|
|
else if(BM_TestHFlag(eed->v2, BM_SELECT)) BM_Select(em->bm, eed, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(selectmode == SCE_SELECT_FACE) {
|
|
|
|
BMIter liter;
|
|
|
|
BMLoop *l;
|
|
|
|
|
|
|
|
/*select all faces associated with every selected vertex*/
|
|
|
|
efa = BMIter_New(&iter, em->bm, BM_FACES_OF_MESH, NULL);
|
|
|
|
for ( ; efa; efa=BMIter_Step(&iter)) {
|
|
|
|
l = BMIter_New(&liter, em->bm, BM_LOOPS_OF_FACE, efa);
|
|
|
|
for (; l; l=BMIter_Step(&liter)) {
|
|
|
|
if (BM_TestHFlag(l->v, BM_SELECT)) {
|
|
|
|
BM_Select(em->bm, efa, 1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(oldmode == SCE_SELECT_EDGE){
|
|
|
|
if(selectmode == SCE_SELECT_FACE) {
|
|
|
|
BMIter liter;
|
|
|
|
BMLoop *l;
|
|
|
|
|
|
|
|
/*select all faces associated with every selected vertex*/
|
|
|
|
efa = BMIter_New(&iter, em->bm, BM_FACES_OF_MESH, NULL);
|
|
|
|
for ( ; efa; efa=BMIter_Step(&iter)) {
|
|
|
|
l = BMIter_New(&liter, em->bm, BM_LOOPS_OF_FACE, efa);
|
|
|
|
for (; l; l=BMIter_Step(&liter)) {
|
|
|
|
if (BM_TestHFlag(l->v, BM_SELECT)) {
|
|
|
|
BM_Select(em->bm, efa, 1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-07-21 08:39:58 +00:00
|
|
|
|
|
|
|
|
2011-08-16 18:45:03 +00:00
|
|
|
void EDBM_deselect_by_material(struct BMEditMesh *em, const short index, const short select)
|
|
|
|
{
|
|
|
|
BMIter iter;
|
|
|
|
BMFace *efa;
|
|
|
|
|
|
|
|
BM_ITER(efa, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(efa, BM_HIDDEN))
|
|
|
|
continue;
|
|
|
|
if(efa->mat_nr == index) {
|
|
|
|
BM_Select(em->bm, efa, select);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-07-21 08:39:58 +00:00
|
|
|
void EDBM_select_swap(BMEditMesh *em) /* exported for UV */
|
|
|
|
{
|
|
|
|
BMIter iter;
|
|
|
|
BMVert *eve;
|
|
|
|
BMEdge *eed;
|
|
|
|
BMFace *efa;
|
|
|
|
|
|
|
|
if(em->bm->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
BM_ITER(eve, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(eve, BM_HIDDEN))
|
|
|
|
continue;
|
|
|
|
BM_Select(em->bm, eve, !BM_TestHFlag(eve, BM_SELECT));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
BM_ITER(eed, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(eed, BM_HIDDEN))
|
|
|
|
continue;
|
|
|
|
BM_Select(em->bm, eed, !BM_TestHFlag(eed, BM_SELECT));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
BM_ITER(efa, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(efa, BM_HIDDEN))
|
|
|
|
continue;
|
|
|
|
BM_Select(em->bm, efa, !BM_TestHFlag(efa, BM_SELECT));
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
// if (EM_texFaceCheck())
|
|
|
|
}
|
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static int select_inverse_mesh_exec(bContext *C, wmOperator *UNUSED(op))
|
2009-07-21 08:39:58 +00:00
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
|
|
|
|
EDBM_select_swap(em);
|
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-07-21 08:39:58 +00:00
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_inverse(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Inverse";
|
|
|
|
ot->idname= "MESH_OT_select_inverse";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select inverse of (un)selected vertices, edges or faces";
|
2009-07-21 08:39:58 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_inverse_mesh_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
2009-08-01 00:53:04 +00:00
|
|
|
|
|
|
|
|
|
|
|
static int select_linked_pick_invoke(bContext *C, wmOperator *op, wmEvent *event)
|
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
ViewContext vc;
|
|
|
|
BMWalker walker;
|
|
|
|
BMEditMesh *em;
|
|
|
|
BMVert *eve;
|
|
|
|
BMEdge *e, *eed;
|
|
|
|
BMFace *efa;
|
|
|
|
int sel= !RNA_boolean_get(op->ptr, "deselect");
|
|
|
|
|
|
|
|
/* unified_finednearest needs ogl */
|
|
|
|
view3d_operator_needs_opengl(C);
|
|
|
|
|
|
|
|
/* setup view context for argument to callbacks */
|
|
|
|
em_setup_viewcontext(C, &vc);
|
|
|
|
em = vc.em;
|
|
|
|
|
|
|
|
if(vc.em->bm->totedge==0)
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
|
|
|
|
vc.mval[0]= event->mval[0];
|
|
|
|
vc.mval[1]= event->mval[1];
|
|
|
|
|
|
|
|
/* return warning! */
|
|
|
|
|
|
|
|
/*if(limit) {
|
|
|
|
int retval= select_linked_limited_invoke(&vc, 0, sel);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-01 00:53:04 +00:00
|
|
|
return retval;
|
|
|
|
}*/
|
|
|
|
|
|
|
|
if( unified_findnearest(&vc, &eve, &eed, &efa)==0 ) {
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-01 00:53:04 +00:00
|
|
|
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (efa) {
|
2010-07-14 22:06:10 +00:00
|
|
|
eed = bm_firstfaceloop(efa)->e;
|
2009-08-01 00:53:04 +00:00
|
|
|
} else if (!eed) {
|
2010-07-14 22:06:10 +00:00
|
|
|
if (!eve || !eve->e)
|
2009-08-01 00:53:04 +00:00
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
|
2010-07-14 22:06:10 +00:00
|
|
|
eed = eve->e;
|
2009-08-01 00:53:04 +00:00
|
|
|
}
|
|
|
|
|
2011-11-24 01:07:36 +00:00
|
|
|
BMW_Init(&walker, em->bm, BMW_SHELL, 0,0,0,0, BMW_NIL_LAY);
|
2009-08-05 02:34:54 +00:00
|
|
|
e = BMW_Begin(&walker, eed->v1);
|
2009-08-01 00:53:04 +00:00
|
|
|
for (; e; e=BMW_Step(&walker)) {
|
2009-08-05 02:34:54 +00:00
|
|
|
BM_Select(em->bm, e->v1, sel);
|
|
|
|
BM_Select(em->bm, e->v2, sel);
|
2009-08-01 00:53:04 +00:00
|
|
|
}
|
2009-08-05 02:34:54 +00:00
|
|
|
BMW_End(&walker);
|
|
|
|
EDBM_select_flush(em, SCE_SELECT_VERTEX);
|
2009-08-01 00:53:04 +00:00
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-01 00:53:04 +00:00
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_linked_pick(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Linked";
|
|
|
|
ot->idname= "MESH_OT_select_linked_pick";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->invoke= select_linked_pick_invoke;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "select/deselect all vertices linked to the edge under the mouse cursor";
|
2009-08-01 00:53:04 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
RNA_def_boolean(ot->srna, "deselect", 0, "Deselect", "");
|
|
|
|
RNA_def_boolean(ot->srna, "limit", 0, "Limit by Seams", "");
|
|
|
|
}
|
2009-08-05 02:34:54 +00:00
|
|
|
|
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static int select_linked_exec(bContext *C, wmOperator *UNUSED(op))
|
2009-08-05 02:34:54 +00:00
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh*)obedit->data)->edit_btmesh;
|
2009-09-17 23:05:33 +00:00
|
|
|
BLI_array_declare(verts);
|
2009-08-05 02:34:54 +00:00
|
|
|
BMVert **verts = NULL;
|
|
|
|
BMIter iter;
|
|
|
|
BMVert *v;
|
|
|
|
BMEdge *e;
|
|
|
|
BMWalker walker;
|
|
|
|
int i, tot;
|
|
|
|
|
|
|
|
tot = 0;
|
2011-05-12 01:55:08 +00:00
|
|
|
BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(v, BM_SELECT) && !BM_TestHFlag(v, BM_HIDDEN)) {
|
2009-09-17 23:05:33 +00:00
|
|
|
BLI_array_growone(verts);
|
2009-08-05 02:34:54 +00:00
|
|
|
verts[tot++] = v;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-24 01:07:36 +00:00
|
|
|
BMW_Init(&walker, em->bm, BMW_SHELL, 0,0,0,0, BMW_NIL_LAY);
|
2009-08-05 02:34:54 +00:00
|
|
|
for (i=0; i<tot; i++) {
|
|
|
|
e = BMW_Begin(&walker, verts[i]);
|
|
|
|
for (; e; e=BMW_Step(&walker)) {
|
|
|
|
BM_Select(em->bm, e->v1, 1);
|
|
|
|
BM_Select(em->bm, e->v2, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
BMW_End(&walker);
|
|
|
|
EDBM_select_flush(em, SCE_SELECT_VERTEX);
|
|
|
|
|
2009-09-17 23:05:33 +00:00
|
|
|
BLI_array_free(verts);
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-05 02:34:54 +00:00
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_linked(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Linked All";
|
|
|
|
ot->idname= "MESH_OT_select_linked";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_linked_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select all vertices linked to the active mesh";
|
2009-08-05 02:34:54 +00:00
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
RNA_def_boolean(ot->srna, "limit", 0, "Limit by Seams", "");
|
|
|
|
}
|
2009-08-05 07:15:17 +00:00
|
|
|
|
|
|
|
/* ******************** **************** */
|
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
static int select_more(bContext *C, wmOperator *op)
|
2009-08-05 07:15:17 +00:00
|
|
|
{
|
2009-08-06 05:06:55 +00:00
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= (((Mesh *)obedit->data))->edit_btmesh;
|
|
|
|
BMOperator bmop;
|
|
|
|
int usefaces = em->selectmode > SCE_SELECT_EDGE;
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
EDBM_InitOpf(em, &bmop, op, "regionextend geom=%hvef constrict=%d usefaces=%d",
|
|
|
|
BM_SELECT, 0, usefaces);
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
BMO_Exec_Op(em->bm, &bmop);
|
Brought Extrude all the way back. The contextual menu works,
as does only edges and individual faces extrude (individual vert
extrude already did).
Note that I need to port this, after we all figure out how to handle
operators with variable transform follow-ons.
I also implemented the merge->collapse function, which is currently
accessable under ctrl->v, Bmesh Test Operator. I still need to
implement the other merge modes, and properly hook everything into
the merge menu tool, which I plan on doing soon (tomorrow hopefully).
The cool thing about the collapse tool, is not only does it handle (all)
UV layers, it handles vcols as well. To do this, I had to add a few math
functions to the customdata API, which seem to be working well.
2009-08-11 07:49:35 +00:00
|
|
|
BMO_HeaderFlag_Buffer(em->bm, &bmop, "geomout", BM_SELECT, BM_ALL);
|
2009-08-05 07:15:17 +00:00
|
|
|
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
if (!EDBM_FinishOp(em, &bmop, op, 1))
|
|
|
|
return OPERATOR_CANCELLED;
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-05 07:15:17 +00:00
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_more(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select More";
|
|
|
|
ot->idname= "MESH_OT_select_more";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select more vertices, edges or faces connected to initial selection";
|
2009-08-05 07:15:17 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_more;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
static int select_less(bContext *C, wmOperator *op)
|
2009-08-05 07:15:17 +00:00
|
|
|
{
|
2009-08-06 05:06:55 +00:00
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= (((Mesh *)obedit->data))->edit_btmesh;
|
|
|
|
BMOperator bmop;
|
|
|
|
int usefaces = em->selectmode > SCE_SELECT_EDGE;
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
EDBM_InitOpf(em, &bmop, op, "regionextend geom=%hvef constrict=%d usefaces=%d",
|
|
|
|
BM_SELECT, 1, usefaces);
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
BMO_Exec_Op(em->bm, &bmop);
|
Brought Extrude all the way back. The contextual menu works,
as does only edges and individual faces extrude (individual vert
extrude already did).
Note that I need to port this, after we all figure out how to handle
operators with variable transform follow-ons.
I also implemented the merge->collapse function, which is currently
accessable under ctrl->v, Bmesh Test Operator. I still need to
implement the other merge modes, and properly hook everything into
the merge menu tool, which I plan on doing soon (tomorrow hopefully).
The cool thing about the collapse tool, is not only does it handle (all)
UV layers, it handles vcols as well. To do this, I had to add a few math
functions to the customdata API, which seem to be working well.
2009-08-11 07:49:35 +00:00
|
|
|
BMO_UnHeaderFlag_Buffer(em->bm, &bmop, "geomout", BM_SELECT, BM_ALL);
|
2009-08-05 07:15:17 +00:00
|
|
|
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
|
2009-08-06 05:06:55 +00:00
|
|
|
if (!EDBM_FinishOp(em, &bmop, op, 1))
|
|
|
|
return OPERATOR_CANCELLED;
|
2009-08-05 07:15:17 +00:00
|
|
|
|
2009-09-16 17:43:09 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
2009-08-05 07:15:17 +00:00
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_less(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Less";
|
|
|
|
ot->idname= "MESH_OT_select_less";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Deselect vertices, edges or faces at the boundary of each selection region";
|
2009-08-05 07:15:17 +00:00
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_less;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* Walk all reachable elements of the same type as h_act in breadth-first
|
|
|
|
order, starting from h_act. Deselects elements if the depth when they
|
|
|
|
are reached is not a multiple of "nth". */
|
|
|
|
static void walker_deselect_nth(BMEditMesh *em, int nth, int offset, BMHeader *h_act)
|
2011-09-26 00:32:45 +00:00
|
|
|
{
|
2011-09-26 03:38:30 +00:00
|
|
|
BMHeader *h;
|
2011-08-28 17:15:24 +00:00
|
|
|
BMesh *bm = em->bm;
|
2011-09-26 03:38:30 +00:00
|
|
|
BMWalker walker;
|
2011-08-28 17:15:24 +00:00
|
|
|
BMIter iter;
|
2011-09-26 03:38:30 +00:00
|
|
|
int walktype = 0, itertype = 0, flushtype = 0;
|
2011-11-24 01:07:36 +00:00
|
|
|
short mask_vert=0, mask_edge=0, mask_loop=0, mask_face=0;
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* No active element from which to start - nothing to do */
|
|
|
|
if(h_act==NULL) {
|
2010-01-05 22:33:41 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* Determine which type of iter, walker, and select flush to use
|
|
|
|
based on type of the elements being deselected */
|
2011-11-01 14:36:23 +00:00
|
|
|
switch (h_act->htype) {
|
2011-09-26 03:38:30 +00:00
|
|
|
case BM_VERT:
|
|
|
|
itertype = BM_VERTS_OF_MESH;
|
|
|
|
walktype = BMW_CONNECTED_VERTEX;
|
|
|
|
flushtype = SCE_SELECT_VERTEX;
|
2011-11-24 01:07:36 +00:00
|
|
|
mask_vert = BM_SELECT;
|
2011-09-26 03:38:30 +00:00
|
|
|
break;
|
|
|
|
case BM_EDGE:
|
|
|
|
itertype = BM_EDGES_OF_MESH;
|
|
|
|
walktype = BMW_SHELL;
|
|
|
|
flushtype = SCE_SELECT_EDGE;
|
2011-11-24 01:07:36 +00:00
|
|
|
mask_edge = BM_SELECT;
|
2011-09-26 03:38:30 +00:00
|
|
|
break;
|
|
|
|
case BM_FACE:
|
|
|
|
itertype = BM_FACES_OF_MESH;
|
|
|
|
walktype = BMW_ISLAND;
|
|
|
|
flushtype = SCE_SELECT_FACE;
|
2011-11-24 01:07:36 +00:00
|
|
|
mask_face = BM_SELECT;
|
2011-09-26 03:38:30 +00:00
|
|
|
break;
|
2011-09-26 00:32:45 +00:00
|
|
|
}
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* Walker restrictions uses BMO flags, not header flags,
|
|
|
|
so transfer BM_SELECT from HFlags onto a BMO flag layer. */
|
|
|
|
BMO_push(bm, NULL);
|
|
|
|
BM_ITER(h, &iter, bm, itertype, NULL) {
|
|
|
|
if (BM_TestHFlag(h, BM_SELECT)) {
|
|
|
|
BMO_SetFlag(bm, h, BM_SELECT);
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* Walk over selected elements starting at active */
|
2011-11-24 01:07:36 +00:00
|
|
|
BMW_Init(&walker, bm, walktype, mask_vert,mask_edge,mask_loop,mask_face, BMW_NIL_LAY);
|
2011-09-26 03:38:30 +00:00
|
|
|
BLI_assert(walker.order == BMW_BREADTH_FIRST);
|
|
|
|
for (h = BMW_Begin(&walker, h_act); h != NULL; h = BMW_Step(&walker)) {
|
|
|
|
/* Deselect elements that aren't at "nth" depth from active */
|
|
|
|
if ((offset + BMW_CurrentDepth(&walker)) % nth) {
|
|
|
|
BM_Select(bm, h, 0);
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
|
|
|
}
|
2011-09-26 03:38:30 +00:00
|
|
|
BMW_End(&walker);
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
BMO_pop(bm);
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
/* Flush selection up */
|
|
|
|
EDBM_select_flush(em, flushtype);
|
2011-08-28 17:15:24 +00:00
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-08-28 17:15:24 +00:00
|
|
|
static void deselect_nth_active(BMEditMesh *em, BMVert **v_p, BMEdge **e_p, BMFace **f_p)
|
2010-01-05 22:33:41 +00:00
|
|
|
{
|
2011-08-28 17:15:24 +00:00
|
|
|
BMVert *v;
|
|
|
|
BMEdge *e;
|
|
|
|
BMFace *f;
|
|
|
|
BMIter iter;
|
|
|
|
BMEditSelection *ese;
|
|
|
|
|
|
|
|
*v_p= NULL;
|
|
|
|
*e_p= NULL;
|
|
|
|
*f_p= NULL;
|
|
|
|
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
ese= (BMEditSelection*)em->bm->selected.last;
|
|
|
|
|
2010-01-05 22:33:41 +00:00
|
|
|
if(ese) {
|
2011-11-01 14:36:23 +00:00
|
|
|
switch(ese->htype) {
|
2011-08-28 17:15:24 +00:00
|
|
|
case BM_VERT:
|
|
|
|
*v_p= (BMVert *)ese->data;
|
|
|
|
return;
|
|
|
|
case BM_EDGE:
|
|
|
|
*e_p= (BMEdge *)ese->data;
|
|
|
|
return;
|
|
|
|
case BM_FACE:
|
|
|
|
*f_p= (BMFace *)ese->data;
|
|
|
|
return;
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
2011-08-28 17:15:24 +00:00
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
|
2011-08-28 17:15:24 +00:00
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(v, BM_SELECT)) {
|
|
|
|
*v_p = v;
|
|
|
|
return;
|
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
|
|
|
}
|
2011-08-28 17:15:24 +00:00
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(e, BM_SELECT)) {
|
|
|
|
*e_p = e;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_FACE) {
|
2011-09-13 13:41:20 +00:00
|
|
|
f= BM_get_actFace(em->bm, 1);
|
2011-08-28 17:15:24 +00:00
|
|
|
if(f) {
|
|
|
|
*f_p= f;
|
|
|
|
return;
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
|
|
|
}
|
2011-08-28 17:15:24 +00:00
|
|
|
}
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
static int EM_deselect_nth(BMEditMesh *em, int nth, int offset)
|
2011-08-28 17:15:24 +00:00
|
|
|
{
|
|
|
|
BMVert *v;
|
|
|
|
BMEdge *e;
|
|
|
|
BMFace *f;
|
|
|
|
|
|
|
|
deselect_nth_active(em, &v, &e, &f);
|
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
if (v) {
|
2011-09-27 11:38:55 +00:00
|
|
|
walker_deselect_nth(em, nth, offset, &v->head);
|
2011-08-28 17:15:24 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else if(e) {
|
2011-09-27 11:38:55 +00:00
|
|
|
walker_deselect_nth(em, nth, offset, &e->head);
|
2011-08-28 17:15:24 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else if(f) {
|
2011-09-27 11:38:55 +00:00
|
|
|
walker_deselect_nth(em, nth, offset, &f->head);
|
2011-08-28 17:15:24 +00:00
|
|
|
return 1;
|
|
|
|
}
|
2010-01-05 22:33:41 +00:00
|
|
|
|
|
|
|
return 0;
|
2011-08-28 17:15:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int mesh_select_nth_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
int nth= RNA_int_get(op->ptr, "nth");
|
2011-09-26 03:38:30 +00:00
|
|
|
int offset= RNA_int_get(op->ptr, "offset");
|
|
|
|
|
|
|
|
offset = MIN2(nth, offset);
|
2011-08-28 17:15:24 +00:00
|
|
|
|
2011-09-26 03:38:30 +00:00
|
|
|
if(EM_deselect_nth(em, nth, offset) == 0) {
|
2011-09-23 13:31:48 +00:00
|
|
|
BKE_report(op->reports, RPT_ERROR, "Mesh has no active vert/edge/face");
|
2011-08-28 17:15:24 +00:00
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
}
|
|
|
|
|
|
|
|
DAG_id_tag_update(obedit->data, OB_RECALC_DATA);
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_DATA, obedit->data);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MESH_OT_select_nth(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Nth";
|
|
|
|
ot->description= "";
|
|
|
|
ot->idname= "MESH_OT_select_nth";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= mesh_select_nth_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
RNA_def_int(ot->srna, "nth", 2, 2, 100, "Nth Selection", "", 1, INT_MAX);
|
2011-09-26 03:38:30 +00:00
|
|
|
RNA_def_int(ot->srna, "offset", 0, 0, 100, "Offset", "", 0, INT_MAX);
|
2010-01-05 22:33:41 +00:00
|
|
|
}
|
2010-01-28 00:45:30 +00:00
|
|
|
|
|
|
|
void em_setup_viewcontext(bContext *C, ViewContext *vc)
|
|
|
|
{
|
|
|
|
view3d_set_viewcontext(C, vc);
|
|
|
|
|
|
|
|
if(vc->obedit) {
|
|
|
|
Mesh *me= vc->obedit->data;
|
|
|
|
vc->em= me->edit_btmesh;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* poll call for mesh operators requiring a view3d context */
|
|
|
|
int EM_view3d_poll(bContext *C)
|
|
|
|
{
|
|
|
|
if(ED_operator_editmesh(C) && ED_operator_view3d_active(C))
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
2010-03-04 01:07:26 +00:00
|
|
|
|
|
|
|
|
|
|
|
static int select_sharp_edges_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
/* Find edges that have exactly two neighboring faces,
|
|
|
|
* check the angle between those faces, and if angle is
|
|
|
|
* small enough, select the edge
|
|
|
|
*/
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
BMIter iter;
|
|
|
|
BMEdge *e;
|
|
|
|
BMLoop *l1, *l2;
|
|
|
|
float sharp = RNA_float_get(op->ptr, "sharpness"), angle;
|
|
|
|
|
2011-08-29 01:05:35 +00:00
|
|
|
sharp = DEG2RADF(sharp);
|
2010-03-04 01:07:26 +00:00
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
2010-07-14 22:06:10 +00:00
|
|
|
if (BM_TestHFlag(e, BM_HIDDEN) || !e->l)
|
2010-03-04 01:07:26 +00:00
|
|
|
continue;
|
|
|
|
|
2010-07-14 22:06:10 +00:00
|
|
|
l1 = e->l;
|
|
|
|
l2 = l1->radial_next;
|
2010-03-04 01:07:26 +00:00
|
|
|
|
|
|
|
if (l1 == l2)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* edge has exactly two neighboring faces, check angle */
|
|
|
|
angle = saacos(l1->f->no[0]*l2->f->no[0]+l1->f->no[1]*l2->f->no[1]+l1->f->no[2]*l2->f->no[2]);
|
|
|
|
|
2011-08-29 01:05:35 +00:00
|
|
|
if (fabsf(angle) < sharp) {
|
2010-03-04 01:07:26 +00:00
|
|
|
BM_Select(em->bm, e, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_edges_select_sharp(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Sharp Edges";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Marked selected edges as sharp";
|
2010-03-04 01:07:26 +00:00
|
|
|
ot->idname= "MESH_OT_edges_select_sharp";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_sharp_edges_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* props */
|
|
|
|
RNA_def_float(ot->srna, "sharpness", 1.0f, 0.01f, FLT_MAX, "sharpness", "", 1.0f, 180.0f);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int select_linked_flat_faces_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
BMIter iter, liter, liter2;
|
|
|
|
BMFace *f, **stack = NULL;
|
|
|
|
BLI_array_declare(stack);
|
|
|
|
BMLoop *l, *l2;
|
|
|
|
float sharp = RNA_float_get(op->ptr, "sharpness");
|
|
|
|
int i;
|
|
|
|
|
|
|
|
sharp = (sharp * M_PI) / 180.0;
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(f, BM_TMP_TAG);
|
2010-03-04 01:07:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
if (BM_TestHFlag(f, BM_HIDDEN) || !BM_TestHFlag(f, BM_SELECT) || BM_TestHFlag(f, BM_TMP_TAG))
|
2010-03-04 01:07:26 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
BLI_array_empty(stack);
|
|
|
|
i = 1;
|
|
|
|
|
|
|
|
BLI_array_growone(stack);
|
|
|
|
stack[i-1] = f;
|
|
|
|
|
|
|
|
while (i) {
|
|
|
|
f = stack[i-1];
|
|
|
|
i--;
|
|
|
|
|
|
|
|
BM_Select(em->bm, f, 1);
|
|
|
|
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_SetHFlag(f, BM_TMP_TAG);
|
2010-03-04 01:07:26 +00:00
|
|
|
|
|
|
|
BM_ITER(l, &liter, em->bm, BM_LOOPS_OF_FACE, f) {
|
|
|
|
BM_ITER(l2, &liter2, em->bm, BM_LOOPS_OF_LOOP, l) {
|
|
|
|
float angle;
|
|
|
|
|
2011-11-01 12:51:38 +00:00
|
|
|
if (BM_TestHFlag(l2->f, BM_TMP_TAG) || BM_TestHFlag(l2->f, BM_HIDDEN))
|
2010-03-04 01:07:26 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
/* edge has exactly two neighboring faces, check angle */
|
|
|
|
angle = saacos(f->no[0]*l2->f->no[0]+f->no[1]*l2->f->no[1]+f->no[2]*l2->f->no[2]);
|
|
|
|
|
|
|
|
/* invalidate: edge too sharp */
|
|
|
|
if (fabs(angle) < sharp) {
|
|
|
|
BLI_array_growone(stack);
|
|
|
|
stack[i] = l2->f;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BLI_array_free(stack);
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_faces_select_linked_flat(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Linked Flat Faces";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select linked faces by angle";
|
2010-03-04 01:07:26 +00:00
|
|
|
ot->idname= "MESH_OT_faces_select_linked_flat";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_linked_flat_faces_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* props */
|
|
|
|
RNA_def_float(ot->srna, "sharpness", 1.0f, 0.01f, FLT_MAX, "sharpness", "", 1.0f, 180.0f);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int select_non_manifold_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
BMVert *v;
|
|
|
|
BMEdge *e;
|
|
|
|
BMIter iter;
|
|
|
|
|
|
|
|
/* Selects isolated verts, and edges that do not have 2 neighboring
|
|
|
|
* faces
|
|
|
|
*/
|
|
|
|
|
|
|
|
if(em->selectmode==SCE_SELECT_FACE) {
|
|
|
|
BKE_report(op->reports, RPT_ERROR, "Doesn't work in face selection mode");
|
|
|
|
return OPERATOR_CANCELLED;
|
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (!BM_TestHFlag(em->bm, BM_HIDDEN) && BM_Nonmanifold_Vert(em->bm, v))
|
|
|
|
BM_Select(em->bm, v, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
2011-06-21 01:14:21 +00:00
|
|
|
if (!BM_TestHFlag(em->bm, BM_HIDDEN) && BM_Edge_FaceCount(e) != 2)
|
2010-03-04 01:07:26 +00:00
|
|
|
BM_Select(em->bm, e, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_non_manifold(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Non Manifold";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Select all non-manifold vertices or edges";
|
2010-03-04 01:07:26 +00:00
|
|
|
ot->idname= "MESH_OT_select_non_manifold";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_non_manifold_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int mesh_select_random_exec(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= ((Mesh *)obedit->data)->edit_btmesh;
|
|
|
|
BMVert *eve;
|
|
|
|
BMEdge *eed;
|
|
|
|
BMFace *efa;
|
|
|
|
BMIter iter;
|
|
|
|
float randfac = RNA_float_get(op->ptr, "percent")/100.0f;
|
|
|
|
|
|
|
|
BLI_srand( BLI_rand() ); /* random seed */
|
|
|
|
|
|
|
|
if(!RNA_boolean_get(op->ptr, "extend"))
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
|
|
|
|
|
|
|
if(em->selectmode & SCE_SELECT_VERTEX) {
|
|
|
|
BM_ITER(eve, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
|
|
|
if (!BM_TestHFlag(eve, BM_HIDDEN) && BLI_frand() < randfac)
|
|
|
|
BM_Select(em->bm, eve, 1);
|
|
|
|
}
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
}
|
|
|
|
else if(em->selectmode & SCE_SELECT_EDGE) {
|
|
|
|
BM_ITER(eed, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
if (!BM_TestHFlag(eed, BM_HIDDEN) && BLI_frand() < randfac)
|
|
|
|
BM_Select(em->bm, eed, 1);
|
|
|
|
}
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
BM_ITER(efa, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
|
|
|
if (!BM_TestHFlag(efa, BM_HIDDEN) && BLI_frand() < randfac)
|
|
|
|
BM_Select(em->bm, efa, 1);
|
|
|
|
}
|
|
|
|
EDBM_selectmode_flush(em);
|
|
|
|
}
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
|
|
|
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_random(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Random";
|
2011-09-23 13:31:48 +00:00
|
|
|
ot->description= "Randomly select vertices";
|
2010-03-04 01:07:26 +00:00
|
|
|
ot->idname= "MESH_OT_select_random";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= mesh_select_random_exec;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
/* props */
|
2011-09-23 13:31:48 +00:00
|
|
|
RNA_def_float_percentage(ot->srna, "percent", 50.f, 0.0f, 100.0f, "Percent", "Percentage of elements to select randomly", 0.f, 100.0f);
|
|
|
|
RNA_def_boolean(ot->srna, "extend", 0, "Extend Selection", "Extend selection instead of deselecting everything first");
|
2010-03-04 01:07:26 +00:00
|
|
|
}
|
2011-03-27 02:56:41 +00:00
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static int select_next_loop(bContext *C, wmOperator *UNUSED(op))
|
2011-03-27 02:56:41 +00:00
|
|
|
{
|
|
|
|
Object *obedit= CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em= (((Mesh *)obedit->data))->edit_btmesh;
|
|
|
|
BMFace *f;
|
|
|
|
BMVert *v;
|
|
|
|
BMIter iter;
|
|
|
|
|
|
|
|
BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(v, BM_TMP_TAG);
|
2011-03-27 02:56:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
|
|
|
BMLoop *l;
|
|
|
|
BMIter liter;
|
|
|
|
|
|
|
|
BM_ITER(l, &liter, em->bm, BM_LOOPS_OF_FACE, f) {
|
|
|
|
if (BM_TestHFlag(l->v, BM_SELECT) && !BM_TestHFlag(l->v, BM_HIDDEN)) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_SetHFlag(l->next->v, BM_TMP_TAG);
|
2011-03-27 02:56:41 +00:00
|
|
|
BM_Select(em->bm, l->v, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(v, &iter, em->bm, BM_VERTS_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
if (BM_TestHFlag(v, BM_TMP_TAG)) {
|
2011-03-27 02:56:41 +00:00
|
|
|
BM_Select(em->bm, v, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit);
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_select_next_loop(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
|
|
|
ot->name= "Select Next Loop";
|
|
|
|
ot->idname= "MESH_OT_select_next_loop";
|
|
|
|
ot->description= "";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= select_next_loop;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
2011-05-01 20:43:54 +00:00
|
|
|
|
|
|
|
|
2011-05-07 02:48:14 +00:00
|
|
|
static int region_to_loop(bContext *C, wmOperator *UNUSED(op))
|
2011-05-01 20:43:54 +00:00
|
|
|
{
|
|
|
|
Object *obedit = CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em = ((Mesh*)obedit->data)->edit_btmesh;
|
|
|
|
BMFace *f;
|
|
|
|
BMEdge *e;
|
|
|
|
BMIter iter;
|
2011-10-15 14:47:37 +00:00
|
|
|
ViewContext vc;
|
|
|
|
|
|
|
|
em_setup_viewcontext(C, &vc);
|
2011-05-01 20:43:54 +00:00
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(e, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
|
|
|
BMLoop *l1, *l2;
|
|
|
|
BMIter liter1, liter2;
|
|
|
|
|
|
|
|
BM_ITER(l1, &liter1, em->bm, BM_LOOPS_OF_FACE, f) {
|
|
|
|
int tot=0, totsel=0;
|
|
|
|
|
|
|
|
BM_ITER(l2, &liter2, em->bm, BM_LOOPS_OF_EDGE, l1->e) {
|
|
|
|
tot++;
|
|
|
|
totsel += BM_TestHFlag(l2->f, BM_SELECT) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((tot != totsel && totsel > 0) || (totsel == 1 && tot == 1))
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_SetHFlag(l1->e, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
if (BM_TestHFlag(e, BM_TMP_TAG) && !BM_TestHFlag(e, BM_HIDDEN))
|
2011-05-01 20:43:54 +00:00
|
|
|
BM_Select_Edge(em->bm, e, 1);
|
|
|
|
}
|
2011-10-15 14:47:37 +00:00
|
|
|
|
|
|
|
/* If in face-only select mode, switch to edge select mode so that
|
|
|
|
an edge-only selection is not inconsistent state */
|
|
|
|
if (em->selectmode == SCE_SELECT_FACE) {
|
|
|
|
em->selectmode = SCE_SELECT_EDGE;
|
|
|
|
EDBM_selectmode_set(em);
|
|
|
|
EDBM_selectmode_to_scene(C);
|
|
|
|
}
|
|
|
|
|
2011-05-01 20:43:54 +00:00
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
2011-10-15 14:47:37 +00:00
|
|
|
|
2011-05-01 20:43:54 +00:00
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_region_to_loop(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
2011-05-01 21:12:45 +00:00
|
|
|
ot->name= "Select Boundary Loop";
|
2011-05-01 20:43:54 +00:00
|
|
|
ot->idname= "MESH_OT_region_to_loop";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= region_to_loop;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int loop_find_region(BMEditMesh *em, BMLoop *l, int flag,
|
|
|
|
SmallHash *fhash, BMFace ***region_out)
|
|
|
|
{
|
|
|
|
BLI_array_declare(region);
|
|
|
|
BLI_array_declare(stack);
|
|
|
|
BMFace **region = NULL, *f;
|
|
|
|
BMFace **stack = NULL;
|
|
|
|
|
|
|
|
BLI_array_append(stack, l->f);
|
|
|
|
BLI_smallhash_insert(fhash, (uintptr_t)l->f, NULL);
|
|
|
|
|
|
|
|
while (BLI_array_count(stack) > 0) {
|
|
|
|
BMIter liter1, liter2;
|
|
|
|
BMLoop *l1, *l2;
|
|
|
|
|
|
|
|
f = BLI_array_pop(stack);
|
|
|
|
BLI_array_append(region, f);
|
|
|
|
|
|
|
|
BM_ITER(l1, &liter1, em->bm, BM_LOOPS_OF_FACE, f) {
|
|
|
|
if (BM_TestHFlag(l1->e, flag))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
BM_ITER(l2, &liter2, em->bm, BM_LOOPS_OF_EDGE, l1->e) {
|
|
|
|
if (BLI_smallhash_haskey(fhash, (uintptr_t)l2->f))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
BLI_array_append(stack, l2->f);
|
|
|
|
BLI_smallhash_insert(fhash, (uintptr_t)l2->f, NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BLI_array_free(stack);
|
|
|
|
|
|
|
|
*region_out = region;
|
|
|
|
return BLI_array_count(region);
|
|
|
|
}
|
|
|
|
|
2011-05-11 02:14:43 +00:00
|
|
|
static int verg_radial(const void *va, const void *vb)
|
2011-05-01 20:43:54 +00:00
|
|
|
{
|
|
|
|
BMEdge *e1 = *((void**)va);
|
|
|
|
BMEdge *e2 = *((void**)vb);
|
|
|
|
int a, b;
|
|
|
|
|
|
|
|
a = BM_Edge_FaceCount(e1);
|
|
|
|
b = BM_Edge_FaceCount(e2);
|
|
|
|
|
|
|
|
if (a > b) return -1;
|
|
|
|
if (a == b) return 0;
|
|
|
|
if (a < b) return 1;
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int loop_find_regions(BMEditMesh *em, int selbigger)
|
|
|
|
{
|
|
|
|
SmallHash visithash;
|
|
|
|
BMIter iter;
|
|
|
|
BMEdge *e, **edges=NULL;
|
|
|
|
BLI_array_declare(edges);
|
|
|
|
BMFace *f;
|
|
|
|
int count = 0, i;
|
|
|
|
|
|
|
|
BLI_smallhash_init(&visithash);
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(f, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BM_ITER(e, &iter, em->bm, BM_EDGES_OF_MESH, NULL) {
|
|
|
|
if (BM_TestHFlag(e, BM_SELECT)) {
|
|
|
|
BLI_array_append(edges, e);
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_SetHFlag(e, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
} else {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(e, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*sort edges by radial cycle length*/
|
|
|
|
qsort(edges, BLI_array_count(edges), sizeof(void*), verg_radial);
|
|
|
|
|
|
|
|
for (i=0; i<BLI_array_count(edges); i++) {
|
|
|
|
BMIter liter;
|
|
|
|
BMLoop *l;
|
|
|
|
BMFace **region=NULL, **r;
|
|
|
|
int c, tot=0;
|
|
|
|
|
|
|
|
e = edges[i];
|
|
|
|
|
2011-11-01 12:51:38 +00:00
|
|
|
if (!BM_TestHFlag(e, BM_TMP_TAG))
|
2011-05-01 20:43:54 +00:00
|
|
|
continue;
|
|
|
|
|
|
|
|
BM_ITER(l, &liter, em->bm, BM_LOOPS_OF_EDGE, e) {
|
|
|
|
if (BLI_smallhash_haskey(&visithash, (uintptr_t)l->f))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
c = loop_find_region(em, l, BM_SELECT, &visithash, &r);
|
2011-09-30 15:15:57 +00:00
|
|
|
|
2011-05-01 20:43:54 +00:00
|
|
|
if (!region || (selbigger ? c >= tot : c < tot)) {
|
2011-09-30 15:15:57 +00:00
|
|
|
/* this region is the best seen so far */
|
2011-05-01 20:43:54 +00:00
|
|
|
tot = c;
|
2011-09-30 15:15:57 +00:00
|
|
|
if (region) {
|
|
|
|
/* free the previous best */
|
2011-05-01 20:43:54 +00:00
|
|
|
MEM_freeN(region);
|
2011-09-30 15:15:57 +00:00
|
|
|
}
|
|
|
|
/* track the current region as the new best */
|
2011-05-01 20:43:54 +00:00
|
|
|
region = r;
|
|
|
|
}
|
2011-09-30 15:15:57 +00:00
|
|
|
else {
|
|
|
|
/* this region is not as good as best so far, just free it */
|
|
|
|
MEM_freeN(r);
|
|
|
|
}
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (region) {
|
|
|
|
int j;
|
|
|
|
|
|
|
|
for (j=0; j<tot; j++) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_SetHFlag(region[j], BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
BM_ITER(l, &liter, em->bm, BM_LOOPS_OF_FACE, region[j]) {
|
2011-11-01 12:51:38 +00:00
|
|
|
BM_ClearHFlag(l->e, BM_TMP_TAG);
|
2011-05-01 20:43:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
count += tot;
|
|
|
|
|
|
|
|
MEM_freeN(region);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
BLI_array_free(edges);
|
|
|
|
BLI_smallhash_release(&visithash);
|
|
|
|
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int loop_to_region(bContext *C, wmOperator *op)
|
|
|
|
{
|
|
|
|
Object *obedit = CTX_data_edit_object(C);
|
|
|
|
BMEditMesh *em = ((Mesh*)obedit->data)->edit_btmesh;
|
|
|
|
BMIter iter;
|
|
|
|
BMFace *f;
|
|
|
|
int selbigger = RNA_boolean_get(op->ptr, "select_bigger");
|
|
|
|
int a, b;
|
2011-10-15 14:47:37 +00:00
|
|
|
|
2011-05-01 20:43:54 +00:00
|
|
|
/*find the set of regions with smallest number of total faces*/
|
|
|
|
a = loop_find_regions(em, selbigger);
|
|
|
|
b = loop_find_regions(em, !selbigger);
|
|
|
|
|
|
|
|
if ((a <= b) ^ selbigger) {
|
|
|
|
loop_find_regions(em, selbigger);
|
|
|
|
}
|
|
|
|
|
|
|
|
EDBM_clear_flag_all(em, BM_SELECT);
|
|
|
|
|
|
|
|
BM_ITER(f, &iter, em->bm, BM_FACES_OF_MESH, NULL) {
|
2011-11-01 12:51:38 +00:00
|
|
|
if (BM_TestHFlag(f, BM_TMP_TAG) && !BM_TestHFlag(f, BM_HIDDEN)) {
|
2011-05-01 20:43:54 +00:00
|
|
|
BM_Select_Face(em->bm, f, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
WM_event_add_notifier(C, NC_GEOM|ND_SELECT, obedit->data);
|
|
|
|
return OPERATOR_FINISHED;
|
|
|
|
}
|
|
|
|
|
|
|
|
void MESH_OT_loop_to_region(wmOperatorType *ot)
|
|
|
|
{
|
|
|
|
/* identifiers */
|
2011-05-01 21:12:45 +00:00
|
|
|
ot->name= "Select Loop Inner-Region";
|
2011-05-01 20:43:54 +00:00
|
|
|
ot->idname= "MESH_OT_loop_to_region";
|
|
|
|
|
|
|
|
/* api callbacks */
|
|
|
|
ot->exec= loop_to_region;
|
|
|
|
ot->poll= ED_operator_editmesh;
|
|
|
|
|
|
|
|
/* flags */
|
|
|
|
ot->flag= OPTYPE_REGISTER|OPTYPE_UNDO;
|
|
|
|
|
|
|
|
RNA_def_boolean(ot->srna, "select_bigger", 0, "Select Bigger", "Select bigger regions instead of smaller ones");
|
|
|
|
}
|