/* =========================================================================== Copyright (C) 1999-2005 Id Software, Inc. This file is part of Quake III Arena source code. Quake III Arena source code 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. Quake III Arena source code 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 Foobar; if not, write to the Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA =========================================================================== */ #include "stdafx.h" #include "qe3.h" #include "winding.h" #define NEWEDGESEL 1 int FindPoint (vec3_t point) { int i, j; for (i=0 ; i 0.1) break; if (j == 3) return i; } VectorCopy (point, g_qeglobals.d_points[g_qeglobals.d_numpoints]); if (g_qeglobals.d_numpoints < MAX_POINTS-1) { g_qeglobals.d_numpoints++; } return g_qeglobals.d_numpoints-1; } int FindEdge (int p1, int p2, face_t *f) { int i; for (i=0 ; inumpoints ; i++) pnum[i] = FindPoint (w->points[i]); for (i=0 ; inumpoints ; i++) FindEdge (pnum[i], pnum[(i+1)%w->numpoints], f); free (w); } void SetupVertexSelection (void) { face_t *f; brush_t *b; g_qeglobals.d_numpoints = 0; g_qeglobals.d_numedges = 0; #ifdef NEWEDGESEL for (b=selected_brushes.next ; b != &selected_brushes ; b=b->next) { for (f=b->brush_faces ; f ; f=f->next) MakeFace (b,f); } #else if (!QE_SingleBrush()) return; b = selected_brushes.next; for (f=b->brush_faces ; f ; f=f->next) MakeFace (b,f); #endif } #ifdef NEWEDGESEL void SelectFaceEdge (brush_t* b, face_t *f, int p1, int p2) #else void SelectFaceEdge (face_t *f, int p1, int p2) #endif { winding_t *w; int i, j, k; int pnum[128]; #ifdef NEWEDGESEL w = Brush_MakeFaceWinding (b, f); #else w = Brush_MakeFaceWinding (selected_brushes.next, f); #endif if (!w) return; for (i=0 ; inumpoints ; i++) pnum[i] = FindPoint (w->points[i]); for (i=0 ; inumpoints ; i++) if (pnum[i] == p1 && pnum[(i+1)%w->numpoints] == p2) { VectorCopy (g_qeglobals.d_points[pnum[i]], f->planepts[0]); VectorCopy (g_qeglobals.d_points[pnum[(i+1)%w->numpoints]], f->planepts[1]); VectorCopy (g_qeglobals.d_points[pnum[(i+2)%w->numpoints]], f->planepts[2]); for (j=0 ; j<3 ; j++) { for (k=0 ; k<3 ; k++) { f->planepts[j][k] = floor(f->planepts[j][k]/g_qeglobals.d_gridsize+0.5)*g_qeglobals.d_gridsize; } } AddPlanept (f->planepts[0]); AddPlanept (f->planepts[1]); break; } if (i == w->numpoints) Sys_Printf ("SelectFaceEdge: failed\n"); free (w); } void SelectVertex (int p1) { brush_t *b; winding_t *w; int i, j, k; face_t *f; #ifdef NEWEDGESEL for (b=selected_brushes.next ; b != &selected_brushes ; b=b->next) { for (f=b->brush_faces ; f ; f=f->next) { w = Brush_MakeFaceWinding (b, f); if (!w) continue; for (i=0 ; inumpoints ; i++) { if (FindPoint (w->points[i]) == p1) { VectorCopy (w->points[(i+w->numpoints-1)%w->numpoints], f->planepts[0]); VectorCopy (w->points[i], f->planepts[1]); VectorCopy (w->points[(i+1)%w->numpoints], f->planepts[2]); for (j=0 ; j<3 ; j++) { for (k=0 ; k<3 ; k++) { ;//f->planepts[j][k] = floor(f->planepts[j][k]/g_qeglobals.d_gridsize+0.5)*g_qeglobals.d_gridsize; } } AddPlanept (f->planepts[1]); //MessageBeep(-1); break; } } free (w); } } #else b = selected_brushes.next; for (f=b->brush_faces ; f ; f=f->next) { w = Brush_MakeFaceWinding (b, f); if (!w) continue; for (i=0 ; inumpoints ; i++) { if (FindPoint (w->points[i]) == p1) { VectorCopy (w->points[(i+w->numpoints-1)%w->numpoints], f->planepts[0]); VectorCopy (w->points[i], f->planepts[1]); VectorCopy (w->points[(i+1)%w->numpoints], f->planepts[2]); for (j=0 ; j<3 ; j++) { for (k=0 ; k<3 ; k++) { ;//f->planepts[j][k] = floor(f->planepts[j][k]/g_qeglobals.d_gridsize+0.5)*g_qeglobals.d_gridsize; } } AddPlanept (f->planepts[1]); //MessageBeep(-1); break; } } free (w); } #endif } void SelectEdgeByRay (vec3_t org, vec3_t dir) { int i, j, besti; float d, bestd; vec3_t mid, temp; pedge_t *e; // find the edge closest to the ray besti = -1; bestd = 8; for (i=0 ; inext) { SelectFaceEdge (b, e->f1, e->p1, e->p2); SelectFaceEdge (b, e->f2, e->p2, e->p1); } #else SelectFaceEdge (e->f1, e->p1, e->p2); SelectFaceEdge (e->f2, e->p2, e->p1); #endif } void SelectVertexByRay (vec3_t org, vec3_t dir) { int i, besti; float d, bestd; vec3_t temp; // find the point closest to the ray besti = -1; bestd = 8; for (i=0 ; iActiveXY()->AreaSelectOK()) { g_qeglobals.d_select_mode = sel_area; VectorCopy(org, g_qeglobals.d_vAreaTL); VectorCopy(org, g_qeglobals.d_vAreaBR); } return; } //Sys_Printf ("hit vertex\n"); AddPatchMovePoint(g_qeglobals.d_points[besti], buttons & MK_CONTROL, buttons & MK_SHIFT); }