2 BobToolz plugin for GtkRadiant
3 Copyright (C) 2001 Gordon Biggans
5 This library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 This library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with this library; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // DBrush.cpp: implementation of the DBrush class.
22 //////////////////////////////////////////////////////////////////////
27 #pragma warning(disable : 4786)
32 #include "dialogs/dialogs-gtk.h"
36 //////////////////////////////////////////////////////////////////////
37 // Construction/Destruction
38 //////////////////////////////////////////////////////////////////////
40 DBrush::DBrush( int ID ){
51 //////////////////////////////////////////////////////////////////////
53 //////////////////////////////////////////////////////////////////////
55 DPlane* DBrush::AddFace( vec3_t va, vec3_t vb, vec3_t vc, _QERFaceData* texData ){
57 // Sys_Printf("(%f %f %f) (%f %f %f) (%f %f %f)\n", va[0], va[1], va[2], vb[0], vb[1], vb[2], vc[0], vc[1], vc[2]);
60 DPlane* newFace = new DPlane( va, vb, vc, texData );
61 faceList.push_back( newFace );
66 int DBrush::BuildPoints(){
69 if ( faceList.size() <= 3 ) { // if less than 3 faces, there can be no points
70 return 0; // with only 3 faces u can't have a bounded soild
73 for ( list<DPlane *>::const_iterator p1 = faceList.begin(); p1 != faceList.end(); p1++ )
75 list<DPlane *>::const_iterator p2 = p1;
76 for ( p2++; p2 != faceList.end(); p2++ )
78 list<DPlane *>::const_iterator p3 = p2;
79 for ( p3++; p3 != faceList.end(); p3++ )
82 if ( ( *p1 )->PlaneIntersection( *p2, *p3, pnt ) ) {
83 int pos = PointPosition( pnt );
85 if ( pos == POINT_IN_BRUSH ) { // ???? shouldn't happen here
86 Sys_Printf( "ERROR:: Build Brush Points: Point IN brush!!!\n" );
88 else if ( pos == POINT_ON_BRUSH ) { // normal point
89 if ( !HasPoint( pnt ) ) {
93 Sys_Printf("Duplicate Point Found, pyramids ahoy!!!!!\n");*/
94 // point lies on more that 3 planes
97 // otherwise point is removed due to another plane..
99 // Sys_Printf("(%f, %f, %f)\n", pnt[0], pnt[1], pnt[2]);
106 // Sys_Printf("%i points on brush\n", pointList.size());
109 return pointList.size();
112 void DBrush::LoadFromBrush_t( brush_t* brush, bool textured ){
116 for ( int i = g_FuncTable.m_pfnGetFaceCount( brush ) - 1; i >= 0 ; i-- )
117 { // running backwards so i dont have to use the count function each time (OPT)
118 _QERFaceData* faceData = g_FuncTable.m_pfnGetFaceData( brush, i );
120 if ( faceData == NULL ) {
121 DoMessageBox( "Null pointer returned", "WARNING!", MB_OK );
125 AddFace( faceData->m_v1, faceData->m_v2, faceData->m_v3, faceData );
128 AddFace( faceData->m_v1, faceData->m_v2, faceData->m_v3, NULL );
135 int DBrush::PointPosition( vec3_t pnt ){
136 int state = POINT_IN_BRUSH; // if nothing happens point is inside brush
138 for ( list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
140 float dist = ( *chkPlane )->DistanceToPoint( pnt );
142 if ( dist > MAX_ROUND_ERROR ) {
143 return POINT_OUT_BRUSH; // if point is in front of plane, it CANT be in the brush
145 else if ( fabs( dist ) < MAX_ROUND_ERROR ) {
146 state = POINT_ON_BRUSH; // if point is ON plane point is either ON the brush
148 // or outside it, it can no longer be in it
154 void DBrush::ClearPoints(){
155 for ( list<DPoint *>::const_iterator deadPoint = pointList.begin(); deadPoint != pointList.end(); deadPoint++ ) {
161 void DBrush::ClearFaces(){
162 bBoundsBuilt = FALSE;
163 for ( list<DPlane *>::const_iterator deadPlane = faceList.begin(); deadPlane != faceList.end(); deadPlane++ )
170 void DBrush::AddPoint( vec3_t pnt ){
171 DPoint* newPoint = new DPoint;
172 VectorCopy( pnt, newPoint->_pnt );
173 pointList.push_back( newPoint );
176 bool DBrush::HasPoint( vec3_t pnt ){
177 for ( list<DPoint *>::const_iterator chkPoint = pointList.begin(); chkPoint != pointList.end(); chkPoint++ )
179 if ( **chkPoint == pnt ) {
187 int DBrush::RemoveRedundantPlanes(){
189 list<DPlane *>::iterator chkPlane;
191 // find duplicate planes
192 list<DPlane *>::iterator p1 = faceList.begin();
194 while ( p1 != faceList.end() )
196 list<DPlane *>::iterator p2 = p1;
198 for ( p2++; p2 != faceList.end(); p2++ )
200 if ( **p1 == **p2 ) {
201 if ( !strcmp( ( *p1 )->texInfo.m_TextureName, "textures/common/caulk" ) ) {
203 p1 = faceList.erase( p1 ); // duplicate plane
208 p2 = faceList.erase( p2 ); // duplicate plane
216 if ( p2 == faceList.end() ) {
221 //+djbob kill planes with bad normal, they are more of a nuisance than losing a brush
222 chkPlane = faceList.begin();
223 while ( chkPlane != faceList.end() )
225 if ( VectorLength( ( *chkPlane )->normal ) == 0 ) { // plane has bad normal
227 chkPlane = faceList.erase( chkPlane );
236 if ( pointList.size() == 0 ) { // if points may not have been built, build them
237 /* if(BuildPoints() == 0) // just let the planes die if they are all bad
242 chkPlane = faceList.begin();
243 while ( chkPlane != faceList.end() )
245 if ( ( *chkPlane )->IsRedundant( pointList ) ) { // checks that plane "0wnz" :), 3 or more points
247 chkPlane = faceList.erase( chkPlane );
258 bool DBrush::GetBounds( vec3_t min, vec3_t max ){
261 if ( !bBoundsBuilt ) {
265 VectorCopy( bbox_min, min );
266 VectorCopy( bbox_max, max );
271 bool DBrush::BBoxCollision( DBrush* chkBrush ){
275 GetBounds( min1, max1 );
276 chkBrush->GetBounds( min2, max2 );
278 if ( min1[0] >= max2[0] ) {
281 if ( min1[1] >= max2[1] ) {
284 if ( min1[2] >= max2[2] ) {
288 if ( max1[0] <= min2[0] ) {
291 if ( max1[1] <= min2[1] ) {
294 if ( max1[2] <= min2[2] ) {
301 DPlane* DBrush::HasPlane( DPlane* chkPlane ){
302 for ( list<DPlane *>::const_iterator brushPlane = faceList.begin(); brushPlane != faceList.end(); brushPlane++ )
304 if ( **brushPlane == *chkPlane ) {
311 bool DBrush::IsCutByPlane( DPlane *cuttingPlane ){
314 if ( pointList.size() == 0 ) {
315 if ( BuildPoints() == 0 ) {
320 list<DPoint *>::const_iterator chkPnt = pointList.begin();
322 if ( chkPnt == pointList.end() ) {
326 float dist = cuttingPlane->DistanceToPoint( ( *chkPnt )->_pnt );
328 if ( dist > MAX_ROUND_ERROR ) {
331 else if ( dist < MAX_ROUND_ERROR ) {
338 for ( chkPnt++ = pointList.begin(); chkPnt != pointList.end(); chkPnt++ )
340 dist = cuttingPlane->DistanceToPoint( ( *chkPnt )->_pnt );
342 if ( dist > MAX_ROUND_ERROR ) {
347 else if ( dist < MAX_ROUND_ERROR ) {
360 brush_t* DBrush::BuildInRadiant( bool allowDestruction, int* changeCnt, entity_t* entity ){
361 if ( allowDestruction ) {
364 for ( list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
366 if ( ( *chkPlane )->m_bChkOk ) {
376 //+djbob: fixed bug when brush had no faces "phantom brush" in radiant.
377 if ( faceList.size() < 4 ) {
378 Sys_Printf( "Possible Phantom Brush Found, will not rebuild\n" );
383 QER_brush = (brush_t*)g_FuncTable.m_pfnCreateBrushHandle();
385 for ( list<DPlane *>::const_iterator buildPlane = faceList.begin(); buildPlane != faceList.end(); buildPlane++ ) {
386 if ( ( *buildPlane )->AddToBrush_t( QER_brush ) && changeCnt ) {
392 g_FuncTable.m_pfnCommitBrushHandleToEntity( QER_brush, entity );
393 g_BrushTable.m_pfnBrush_Build( QER_brush, false, false, false, false );
394 g_BrushTable.m_pfnBrush_AddToList( QER_brush, g_AppDataTable.m_pfnSelectedBrushes() );
397 g_FuncTable.m_pfnCommitBrushHandle( QER_brush );
403 void DBrush::CutByPlane( DPlane *cutPlane, DBrush **newBrush1, DBrush **newBrush2 ){
404 if ( !IsCutByPlane( cutPlane ) ) {
410 DBrush* b1 = new DBrush;
411 DBrush* b2 = new DBrush;
413 for ( list<DPlane *>::const_iterator parsePlane = faceList.begin(); parsePlane != faceList.end(); parsePlane++ )
415 b1->AddFace( ( *parsePlane )->points[0], ( *parsePlane )->points[1], ( *parsePlane )->points[2], NULL );
416 b2->AddFace( ( *parsePlane )->points[0], ( *parsePlane )->points[1], ( *parsePlane )->points[2], NULL );
419 b1->AddFace( cutPlane->points[0], cutPlane->points[1], cutPlane->points[2], NULL );
420 b2->AddFace( cutPlane->points[2], cutPlane->points[1], cutPlane->points[0], NULL );
422 b1->RemoveRedundantPlanes();
423 b2->RemoveRedundantPlanes();
429 bool DBrush::IntersectsWith( DBrush *chkBrush ){
430 if ( pointList.size() == 0 ) {
431 if ( BuildPoints() == 0 ) {
432 return FALSE; // invalid brush!!!!
436 if ( chkBrush->pointList.size() == 0 ) {
437 if ( chkBrush->BuildPoints() == 0 ) {
438 return FALSE; // invalid brush!!!!
442 if ( !BBoxCollision( chkBrush ) ) {
446 list<DPlane *>::const_iterator iplPlane;
448 for ( iplPlane = faceList.begin(); iplPlane != faceList.end(); iplPlane++ )
451 bool allInFront = TRUE;
452 for ( list<DPoint *>::const_iterator iPoint = chkBrush->pointList.begin(); iPoint != chkBrush->pointList.end(); iPoint++ )
454 if ( ( *iplPlane )->DistanceToPoint( ( *iPoint )->_pnt ) < -MAX_ROUND_ERROR ) {
464 for ( iplPlane = chkBrush->faceList.begin(); iplPlane != chkBrush->faceList.end(); iplPlane++ )
466 bool allInFront = TRUE;
467 for ( list<DPoint *>::const_iterator iPoint = pointList.begin(); iPoint != pointList.end(); iPoint++ )
469 if ( ( *iplPlane )->DistanceToPoint( ( *iPoint )->_pnt ) < -MAX_ROUND_ERROR ) {
482 bool DBrush::IntersectsWith( DPlane* p1, DPlane* p2, vec3_t v ) {
483 vec3_t vDown = { 0, 0, -1 };
485 list<DPlane *>::const_iterator iplPlane;
486 for ( iplPlane = faceList.begin(); iplPlane != faceList.end(); iplPlane++ ) {
487 DPlane* p = ( *iplPlane );
489 vec_t d = DotProduct( p->normal, vDown );
493 if ( p->PlaneIntersection( p1, p2, v ) ) {
494 if ( PointPosition( v ) != POINT_OUT_BRUSH ) {
503 void DBrush::BuildBounds(){
504 if ( !bBoundsBuilt ) {
505 if ( pointList.size() == 0 ) { // if points may not have been built, build them
506 if ( BuildPoints() == 0 ) {
511 list<DPoint *>::const_iterator first = pointList.begin();
512 VectorCopy( ( *first )->_pnt, bbox_min );
513 VectorCopy( ( *first )->_pnt, bbox_max );
515 list<DPoint *>::const_iterator point = pointList.begin();
516 for ( point++; point != pointList.end(); point++ )
518 if ( ( *point )->_pnt[0] > bbox_max[0] ) {
519 bbox_max[0] = ( *point )->_pnt[0];
521 if ( ( *point )->_pnt[1] > bbox_max[1] ) {
522 bbox_max[1] = ( *point )->_pnt[1];
524 if ( ( *point )->_pnt[2] > bbox_max[2] ) {
525 bbox_max[2] = ( *point )->_pnt[2];
528 if ( ( *point )->_pnt[0] < bbox_min[0] ) {
529 bbox_min[0] = ( *point )->_pnt[0];
531 if ( ( *point )->_pnt[1] < bbox_min[1] ) {
532 bbox_min[1] = ( *point )->_pnt[1];
534 if ( ( *point )->_pnt[2] < bbox_min[2] ) {
535 bbox_min[2] = ( *point )->_pnt[2];
543 bool DBrush::BBoxTouch( DBrush *chkBrush ){
547 GetBounds( min1, max1 );
548 chkBrush->GetBounds( min2, max2 );
550 if ( ( min1[0] - max2[0] ) > MAX_ROUND_ERROR ) {
553 if ( ( min1[1] - max2[1] ) > MAX_ROUND_ERROR ) {
556 if ( ( min1[2] - max2[2] ) > MAX_ROUND_ERROR ) {
560 if ( ( min2[0] - max1[0] ) > MAX_ROUND_ERROR ) {
563 if ( ( min2[1] - max1[1] ) > MAX_ROUND_ERROR ) {
566 if ( ( min2[2] - max1[2] ) > MAX_ROUND_ERROR ) {
572 if ( ( min2[0] - max1[0] ) == 0 ) {
576 if ( ( min2[1] - max1[1] ) == 0 ) {
580 if ( ( min2[2] - max1[2] ) == 0 ) {
584 if ( ( min1[0] - max2[0] ) == 0 ) {
588 if ( ( min1[1] - max2[1] ) == 0 ) {
592 if ( ( min1[2] - max2[2] ) == 0 ) {
603 void DBrush::ResetChecks( list<Str>* exclusionList ){
604 for ( list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
608 if ( exclusionList ) {
609 for ( list<Str>::iterator eTexture = exclusionList->begin(); eTexture != exclusionList->end(); eTexture++ )
611 if ( strstr( ( *resetPlane )->texInfo.m_TextureName, eTexture->GetBuffer() ) ) {
618 ( *resetPlane )->m_bChkOk = set;
622 DPlane* DBrush::HasPlaneInverted( DPlane *chkPlane ){
623 for ( list<DPlane *>::const_iterator brushPlane = faceList.begin(); brushPlane != faceList.end(); brushPlane++ )
625 if ( **brushPlane != *chkPlane ) {
626 if ( fabs( ( *brushPlane )->_d + chkPlane->_d ) < 0.1 ) {
627 return ( *brushPlane );
634 bool DBrush::HasTexture( const char *textureName ){
635 for ( list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
637 if ( strstr( ( *chkPlane )->texInfo.m_TextureName, textureName ) ) {
645 bool DBrush::IsDetail(){
646 for ( list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
648 if ( ( *chkPlane )->texInfo.m_nContents & FACE_DETAIL ) {
656 void DBrush::BuildFromWinding( DWinding *w ){
657 if ( w->numpoints < 3 ) {
658 Sys_ERROR( "Winding has invalid number of points" );
662 DPlane* wPlane = w->WindingPlane();
665 w2 = w->CopyWinding();
667 for ( i = 0; i < w2->numpoints; i++ )
668 VectorAdd( w2->p[i], wPlane->normal, w2->p[i] );
670 AddFace( w2->p[0], w2->p[1], w2->p[2], NULL );
671 AddFace( w->p[2], w->p[1], w->p[0], NULL );
673 for ( i = 0; i < w->numpoints - 1; i++ )
674 AddFace( w2->p[i], w->p[i], w->p[i + 1], NULL );
675 AddFace( w2->p[w->numpoints - 1], w->p[w->numpoints - 1], w->p[0], NULL );
681 void DBrush::SaveToFile( FILE *pFile ){
682 fprintf( pFile, "{\n" );
684 for ( list<DPlane *>::const_iterator pp = faceList.begin(); pp != faceList.end(); pp++ )
688 sprintf( buffer, "( %.0f %.0f %.0f ) ( %.0f %.0f %.0f ) ( %.0f %.0f %.0f ) %s %.0f %.0f %f %f %.0f 0 0 0\n",
689 ( *pp )->points[0][0], ( *pp )->points[0][1], ( *pp )->points[0][2],
690 ( *pp )->points[1][0], ( *pp )->points[1][1], ( *pp )->points[1][2],
691 ( *pp )->points[2][0], ( *pp )->points[2][1], ( *pp )->points[2][2],
692 ( *pp )->texInfo.m_TextureName,
693 ( *pp )->texInfo.m_fShift[0], ( *pp )->texInfo.m_fShift[1],
694 ( *pp )->texInfo.m_fScale[0], ( *pp )->texInfo.m_fScale[0],
695 ( *pp )->texInfo.m_fRotate );
697 fprintf( pFile, "%s", buffer );
700 fprintf( pFile, "}\n" );
703 void DBrush::Rotate( vec3_t vOrigin, vec3_t vRotation ){
704 for ( list<DPlane *>::const_iterator rotPlane = faceList.begin(); rotPlane != faceList.end(); rotPlane++ )
706 for ( int i = 0; i < 3; i++ )
707 VectorRotate( ( *rotPlane )->points[i], vRotation, vOrigin );
709 ( *rotPlane )->Rebuild();
713 void DBrush::RotateAboutCentre( vec3_t vRotation ){
714 vec3_t min, max, centre;
715 GetBounds( min, max );
716 VectorAdd( min, max, centre );
717 VectorScale( centre, 0.5f, centre );
719 Rotate( centre, vRotation );
722 bool DBrush::ResetTextures( const char* textureName, float fScale[2], float fShift[2], int rotation, const char* newTextureName,
723 int bResetTextureName, int bResetScale[2], int bResetShift[2], int bResetRotation ){
725 bool changed = FALSE;
726 for ( list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
728 if ( !strcmp( ( *resetPlane )->texInfo.m_TextureName, textureName ) ) {
729 if ( bResetTextureName ) {
730 strcpy( ( *resetPlane )->texInfo.m_TextureName, newTextureName );
733 if ( bResetScale[0] ) {
734 ( *resetPlane )->texInfo.m_fScale[0] = fScale[0];
736 if ( bResetScale[1] ) {
737 ( *resetPlane )->texInfo.m_fScale[1] = fScale[1];
740 if ( bResetShift[0] ) {
741 ( *resetPlane )->texInfo.m_fShift[0] = fShift[0];
743 if ( bResetShift[1] ) {
744 ( *resetPlane )->texInfo.m_fShift[1] = fShift[1];
747 if ( bResetRotation ) {
748 ( *resetPlane )->texInfo.m_fRotate = (float)rotation;
754 return changed; // no point rebuilding unless we need to, only slows things down
758 for ( list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
760 if ( bResetTextureName ) {
761 strcpy( ( *resetPlane )->texInfo.m_TextureName, newTextureName );
764 if ( bResetScale[0] ) {
765 ( *resetPlane )->texInfo.m_fScale[0] = fScale[0];
767 if ( bResetScale[1] ) {
768 ( *resetPlane )->texInfo.m_fScale[1] = fScale[1];
771 if ( bResetShift[0] ) {
772 ( *resetPlane )->texInfo.m_fShift[0] = fShift[0];
774 if ( bResetShift[1] ) {
775 ( *resetPlane )->texInfo.m_fShift[1] = fShift[1];
778 if ( bResetRotation ) {
779 ( *resetPlane )->texInfo.m_fRotate = (float)rotation;
786 bool DBrush::operator ==( DBrush* other ){
787 list<DPlane *>::const_iterator chkPlane;
789 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
791 if ( !other->HasPlane( ( *chkPlane ) ) ) {
796 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
798 if ( !HasPlane( ( *chkPlane ) ) ) {
806 DPlane* DBrush::AddFace( vec3_t va, vec3_t vb, vec3_t vc, const char *textureName, bool bDetail ){
807 bBoundsBuilt = FALSE;
808 DPlane* newFace = new DPlane( va, vb, vc, textureName, bDetail );
809 faceList.push_back( newFace );
814 DPlane* DBrush::FindPlaneWithClosestNormal( vec_t* normal ) {
816 DPlane* bestDotPlane = NULL;
817 list<DPlane *>::const_iterator chkPlane;
818 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ ) {
819 DPlane* pPlane = ( *chkPlane );
821 vec_t dot = DotProduct( pPlane->normal, normal );
822 if ( dot > bestDot ) {
824 bestDotPlane = pPlane;
831 int DBrush::FindPointsForPlane( DPlane* plane, DPoint** pnts, int maxpnts ) {
840 for ( list<DPoint *>::const_iterator points = pointList.begin(); points != pointList.end(); points++ ) {
841 DPoint* point = ( *points );
843 if ( fabs( plane->DistanceToPoint( point->_pnt ) ) < MAX_ROUND_ERROR ) {
844 pnts[numpnts] = point;
847 if ( numpnts >= maxpnts ) {
857 void DBrush::RemovePlane( DPlane* plane ) {
858 bBoundsBuilt = FALSE;
859 for ( list<DPlane *>::const_iterator deadPlane = faceList.begin(); deadPlane != faceList.end(); deadPlane++ ) {
860 if ( *deadPlane == plane ) {
862 faceList.remove( plane );
867 void DBrush::RemoveFromRadiant( void ) {
869 g_FuncTable.m_pfnDeleteBrushHandle( QER_brush );