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)
40 #include "dialogs/dialogs-gtk.h"
46 #include "generic/referencecounted.h"
50 //////////////////////////////////////////////////////////////////////
51 // Construction/Destruction
52 //////////////////////////////////////////////////////////////////////
54 DBrush::DBrush( int ID ){
66 //////////////////////////////////////////////////////////////////////
68 //////////////////////////////////////////////////////////////////////
70 DPlane* DBrush::AddFace( const vec3_t va, const vec3_t vb, const vec3_t vc, const _QERFaceData* texData ){
72 // 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]);
75 DPlane* newFace = new DPlane( va, vb, vc, texData );
76 faceList.push_back( newFace );
81 int DBrush::BuildPoints(){
84 if ( faceList.size() <= 3 ) { // if less than 3 faces, there can be no points
85 return 0; // with only 3 faces u can't have a bounded soild
88 for ( std::list<DPlane *>::const_iterator p1 = faceList.begin(); p1 != faceList.end(); p1++ )
90 std::list<DPlane *>::const_iterator p2 = p1;
91 for ( p2++; p2 != faceList.end(); p2++ )
93 std::list<DPlane *>::const_iterator p3 = p2;
94 for ( p3++; p3 != faceList.end(); p3++ )
97 if ( ( *p1 )->PlaneIntersection( *p2, *p3, pnt ) ) {
98 int pos = PointPosition( pnt );
100 if ( pos == POINT_IN_BRUSH ) { // ???? shouldn't happen here
101 globalErrorStream() << "ERROR:: Build Brush Points: Point IN brush!!!\n";
103 else if ( pos == POINT_ON_BRUSH ) { // normal point
104 if ( !HasPoint( pnt ) ) {
108 Sys_Printf("Duplicate Point Found, pyramids ahoy!!!!!\n");*/
109 // point lies on more that 3 planes
112 // otherwise point is removed due to another plane..
114 // Sys_Printf("(%f, %f, %f)\n", pnt[0], pnt[1], pnt[2]);
121 // Sys_Printf("%i points on brush\n", pointList.size());
124 return static_cast<int>( pointList.size() );
127 void DBrush_addFace( DBrush& brush, const _QERFaceData& faceData ){
128 brush.AddFace( vector3_to_array( faceData.m_p0 ), vector3_to_array( faceData.m_p1 ), vector3_to_array( faceData.m_p2 ), 0 );
130 typedef ReferenceCaller1<DBrush, const _QERFaceData&, DBrush_addFace> DBrushAddFaceCaller;
132 void DBrush_addFaceTextured( DBrush& brush, const _QERFaceData& faceData ){
133 brush.AddFace( vector3_to_array( faceData.m_p0 ), vector3_to_array( faceData.m_p1 ), vector3_to_array( faceData.m_p2 ), &faceData );
135 typedef ReferenceCaller1<DBrush, const _QERFaceData&, DBrush_addFaceTextured> DBrushAddFaceTexturedCaller;
137 void DBrush::LoadFromBrush( scene::Instance& brush, bool textured ){
141 GlobalBrushCreator().Brush_forEachFace( brush.path().top(), textured ? BrushFaceDataCallback( DBrushAddFaceTexturedCaller( *this ) ) : BrushFaceDataCallback( DBrushAddFaceCaller( *this ) ) );
143 QER_entity = brush.path().parent().get_pointer();
144 QER_brush = brush.path().top().get_pointer();
147 int DBrush::PointPosition( vec3_t pnt ){
148 int state = POINT_IN_BRUSH; // if nothing happens point is inside brush
150 for ( std::list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
152 float dist = ( *chkPlane )->DistanceToPoint( pnt );
154 if ( dist > MAX_ROUND_ERROR ) {
155 return POINT_OUT_BRUSH; // if point is in front of plane, it CANT be in the brush
157 else if ( fabs( dist ) < MAX_ROUND_ERROR ) {
158 state = POINT_ON_BRUSH; // if point is ON plane point is either ON the brush
160 // or outside it, it can no longer be in it
166 void DBrush::ClearPoints(){
167 for ( std::list<DPoint *>::const_iterator deadPoint = pointList.begin(); deadPoint != pointList.end(); deadPoint++ ) {
173 void DBrush::ClearFaces(){
174 bBoundsBuilt = false;
175 for ( std::list<DPlane *>::const_iterator deadPlane = faceList.begin(); deadPlane != faceList.end(); deadPlane++ )
182 void DBrush::AddPoint( vec3_t pnt ){
183 DPoint* newPoint = new DPoint;
184 VectorCopy( pnt, newPoint->_pnt );
185 pointList.push_back( newPoint );
188 bool DBrush::HasPoint( vec3_t pnt ){
189 for ( std::list<DPoint *>::const_iterator chkPoint = pointList.begin(); chkPoint != pointList.end(); chkPoint++ )
191 if ( **chkPoint == pnt ) {
199 int DBrush::RemoveRedundantPlanes(){
201 std::list<DPlane *>::iterator chkPlane;
203 // find duplicate planes
204 std::list<DPlane *>::iterator p1 = faceList.begin();
206 while ( p1 != faceList.end() )
208 std::list<DPlane *>::iterator p2 = p1;
210 for ( p2++; p2 != faceList.end(); p2++ )
212 if ( **p1 == **p2 ) {
213 if ( !strcmp( ( *p1 )->m_shader.c_str(), "textures/common/caulk" ) ) {
215 p1 = faceList.erase( p1 ); // duplicate plane
220 p2 = faceList.erase( p2 ); // duplicate plane
228 if ( p2 == faceList.end() ) {
233 //+djbob kill planes with bad normal, they are more of a nuisance than losing a brush
234 chkPlane = faceList.begin();
235 while ( chkPlane != faceList.end() )
237 if ( VectorLength( ( *chkPlane )->normal ) == 0 ) { // plane has bad normal
239 chkPlane = faceList.erase( chkPlane );
248 if ( pointList.size() == 0 ) { // if points may not have been built, build them
249 /* if(BuildPoints() == 0) // just let the planes die if they are all bad
254 chkPlane = faceList.begin();
255 while ( chkPlane != faceList.end() )
257 if ( ( *chkPlane )->IsRedundant( pointList ) ) { // checks that plane "0wnz" :), 3 or more points
259 chkPlane = faceList.erase( chkPlane );
270 bool DBrush::GetBounds( vec3_t min, vec3_t max ){
273 if ( !bBoundsBuilt ) {
277 VectorCopy( bbox_min, min );
278 VectorCopy( bbox_max, max );
283 bool DBrush::BBoxCollision( DBrush* chkBrush ){
287 GetBounds( min1, max1 );
288 chkBrush->GetBounds( min2, max2 );
290 if ( min1[0] >= max2[0] ) {
293 if ( min1[1] >= max2[1] ) {
296 if ( min1[2] >= max2[2] ) {
300 if ( max1[0] <= min2[0] ) {
303 if ( max1[1] <= min2[1] ) {
306 if ( max1[2] <= min2[2] ) {
313 DPlane* DBrush::HasPlane( DPlane* chkPlane ){
314 for ( std::list<DPlane *>::const_iterator brushPlane = faceList.begin(); brushPlane != faceList.end(); brushPlane++ )
316 if ( **brushPlane == *chkPlane ) {
323 bool DBrush::IsCutByPlane( DPlane *cuttingPlane ){
326 if ( pointList.size() == 0 ) {
327 if ( BuildPoints() == 0 ) {
332 std::list<DPoint *>::const_iterator chkPnt = pointList.begin();
334 if ( chkPnt == pointList.end() ) {
338 float dist = cuttingPlane->DistanceToPoint( ( *chkPnt )->_pnt );
340 if ( dist > MAX_ROUND_ERROR ) {
343 else if ( dist < MAX_ROUND_ERROR ) {
350 for ( chkPnt++ = pointList.begin(); chkPnt != pointList.end(); chkPnt++ )
352 dist = cuttingPlane->DistanceToPoint( ( *chkPnt )->_pnt );
354 if ( dist > MAX_ROUND_ERROR ) {
359 else if ( dist < MAX_ROUND_ERROR ) {
373 scene::Node* DBrush::BuildInRadiant( bool allowDestruction, int* changeCnt, scene::Node* entity ){
374 if ( allowDestruction ) {
377 for ( std::list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
379 if ( ( *chkPlane )->m_bChkOk ) {
389 //+djbob: fixed bug when brush had no faces "phantom brush" in radiant.
390 if ( faceList.size() < 4 ) {
391 globalErrorStream() << "Possible Phantom Brush Found, will not rebuild\n";
396 NodeSmartReference node( GlobalBrushCreator().createBrush() );
398 for ( std::list<DPlane *>::const_iterator buildPlane = faceList.begin(); buildPlane != faceList.end(); buildPlane++ ) {
399 if ( ( *buildPlane )->AddToBrush( node ) && changeCnt ) {
405 Node_getTraversable( *entity )->insert( node );
408 Node_getTraversable( GlobalRadiant().getMapWorldEntity() )->insert( node );
412 QER_brush = node.get_pointer();
414 return node.get_pointer();
417 void DBrush::CutByPlane( DPlane *cutPlane, DBrush **newBrush1, DBrush **newBrush2 ){
418 if ( !IsCutByPlane( cutPlane ) ) {
424 DBrush* b1 = new DBrush;
425 DBrush* b2 = new DBrush;
427 for ( std::list<DPlane *>::const_iterator parsePlane = faceList.begin(); parsePlane != faceList.end(); parsePlane++ )
429 b1->AddFace( ( *parsePlane )->points[0], ( *parsePlane )->points[1], ( *parsePlane )->points[2], NULL );
430 b2->AddFace( ( *parsePlane )->points[0], ( *parsePlane )->points[1], ( *parsePlane )->points[2], NULL );
433 b1->AddFace( cutPlane->points[0], cutPlane->points[1], cutPlane->points[2], NULL );
434 b2->AddFace( cutPlane->points[2], cutPlane->points[1], cutPlane->points[0], NULL );
436 b1->RemoveRedundantPlanes();
437 b2->RemoveRedundantPlanes();
443 bool DBrush::IntersectsWith( DBrush *chkBrush ){
444 if ( pointList.size() == 0 ) {
445 if ( BuildPoints() == 0 ) {
446 return false; // invalid brush!!!!
450 if ( chkBrush->pointList.size() == 0 ) {
451 if ( chkBrush->BuildPoints() == 0 ) {
452 return false; // invalid brush!!!!
456 if ( !BBoxCollision( chkBrush ) ) {
460 std::list<DPlane *>::const_iterator iplPlane;
462 for ( iplPlane = faceList.begin(); iplPlane != faceList.end(); iplPlane++ )
465 bool allInFront = true;
466 for ( std::list<DPoint *>::const_iterator iPoint = chkBrush->pointList.begin(); iPoint != chkBrush->pointList.end(); iPoint++ )
468 if ( ( *iplPlane )->DistanceToPoint( ( *iPoint )->_pnt ) < -MAX_ROUND_ERROR ) {
478 for ( iplPlane = chkBrush->faceList.begin(); iplPlane != chkBrush->faceList.end(); iplPlane++ )
480 bool allInFront = true;
481 for ( std::list<DPoint *>::const_iterator iPoint = pointList.begin(); iPoint != pointList.end(); iPoint++ )
483 if ( ( *iplPlane )->DistanceToPoint( ( *iPoint )->_pnt ) < -MAX_ROUND_ERROR ) {
496 bool DBrush::IntersectsWith( DPlane* p1, DPlane* p2, vec3_t v ) {
497 vec3_t vDown = { 0, 0, -1 };
499 std::list<DPlane *>::const_iterator iplPlane;
500 for ( iplPlane = faceList.begin(); iplPlane != faceList.end(); iplPlane++ ) {
501 DPlane* p = ( *iplPlane );
503 vec_t d = DotProduct( p->normal, vDown );
507 if ( p->PlaneIntersection( p1, p2, v ) ) {
508 if ( PointPosition( v ) != POINT_OUT_BRUSH ) {
517 void DBrush::BuildBounds(){
518 if ( !bBoundsBuilt ) {
519 if ( pointList.size() == 0 ) { // if points may not have been built, build them
520 if ( BuildPoints() == 0 ) {
525 std::list<DPoint *>::const_iterator first = pointList.begin();
526 VectorCopy( ( *first )->_pnt, bbox_min );
527 VectorCopy( ( *first )->_pnt, bbox_max );
529 std::list<DPoint *>::const_iterator point = pointList.begin();
530 for ( point++; point != pointList.end(); point++ )
532 if ( ( *point )->_pnt[0] > bbox_max[0] ) {
533 bbox_max[0] = ( *point )->_pnt[0];
535 if ( ( *point )->_pnt[1] > bbox_max[1] ) {
536 bbox_max[1] = ( *point )->_pnt[1];
538 if ( ( *point )->_pnt[2] > bbox_max[2] ) {
539 bbox_max[2] = ( *point )->_pnt[2];
542 if ( ( *point )->_pnt[0] < bbox_min[0] ) {
543 bbox_min[0] = ( *point )->_pnt[0];
545 if ( ( *point )->_pnt[1] < bbox_min[1] ) {
546 bbox_min[1] = ( *point )->_pnt[1];
548 if ( ( *point )->_pnt[2] < bbox_min[2] ) {
549 bbox_min[2] = ( *point )->_pnt[2];
557 bool DBrush::BBoxTouch( DBrush *chkBrush ){
561 GetBounds( min1, max1 );
562 chkBrush->GetBounds( min2, max2 );
564 if ( ( min1[0] - max2[0] ) > MAX_ROUND_ERROR ) {
567 if ( ( min1[1] - max2[1] ) > MAX_ROUND_ERROR ) {
570 if ( ( min1[2] - max2[2] ) > MAX_ROUND_ERROR ) {
574 if ( ( min2[0] - max1[0] ) > MAX_ROUND_ERROR ) {
577 if ( ( min2[1] - max1[1] ) > MAX_ROUND_ERROR ) {
580 if ( ( min2[2] - max1[2] ) > MAX_ROUND_ERROR ) {
586 if ( ( min2[0] - max1[0] ) == 0 ) {
590 if ( ( min2[1] - max1[1] ) == 0 ) {
594 if ( ( min2[2] - max1[2] ) == 0 ) {
598 if ( ( min1[0] - max2[0] ) == 0 ) {
602 if ( ( min1[1] - max2[1] ) == 0 ) {
606 if ( ( min1[2] - max2[2] ) == 0 ) {
617 void DBrush::ResetChecks( std::list<Str>* exclusionList ){
618 for ( std::list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
622 if ( exclusionList ) {
623 for ( std::list<Str>::iterator eTexture = exclusionList->begin(); eTexture != exclusionList->end(); eTexture++ )
625 if ( strstr( ( *resetPlane )->m_shader.c_str(), eTexture->GetBuffer() ) ) {
632 ( *resetPlane )->m_bChkOk = set;
636 DPlane* DBrush::HasPlaneInverted( DPlane *chkPlane ){
637 for ( std::list<DPlane *>::const_iterator brushPlane = faceList.begin(); brushPlane != faceList.end(); brushPlane++ )
639 if ( **brushPlane != *chkPlane ) {
640 if ( fabs( ( *brushPlane )->_d + chkPlane->_d ) < 0.1 ) {
641 return ( *brushPlane );
648 bool DBrush::HasTexture( const char *textureName ){
649 for ( std::list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
651 if ( strstr( ( *chkPlane )->m_shader.c_str(), textureName ) ) {
659 bool DBrush::IsDetail(){
660 for ( std::list<DPlane *>::const_iterator chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
662 if ( ( *chkPlane )->texInfo.contents & FACE_DETAIL ) {
670 void DBrush::BuildFromWinding( DWinding *w ){
671 if ( w->numpoints < 3 ) {
672 globalErrorStream() << "Winding has invalid number of points";
676 DPlane* wPlane = w->WindingPlane();
679 w2 = w->CopyWinding();
681 for ( i = 0; i < w2->numpoints; i++ )
682 VectorAdd( w2->p[i], wPlane->normal, w2->p[i] );
684 AddFace( w2->p[0], w2->p[1], w2->p[2], NULL );
685 AddFace( w->p[2], w->p[1], w->p[0], NULL );
687 for ( i = 0; i < w->numpoints - 1; i++ )
688 AddFace( w2->p[i], w->p[i], w->p[i + 1], NULL );
689 AddFace( w2->p[w->numpoints - 1], w->p[w->numpoints - 1], w->p[0], NULL );
695 void DBrush::SaveToFile( FILE *pFile ){
696 fprintf( pFile, "{\n" );
698 for ( std::list<DPlane *>::const_iterator pp = faceList.begin(); pp != faceList.end(); pp++ )
702 sprintf( buffer, "( %.0f %.0f %.0f ) ( %.0f %.0f %.0f ) ( %.0f %.0f %.0f ) %s %.0f %.0f %f %f %.0f 0 0 0\n",
703 ( *pp )->points[0][0], ( *pp )->points[0][1], ( *pp )->points[0][2],
704 ( *pp )->points[1][0], ( *pp )->points[1][1], ( *pp )->points[1][2],
705 ( *pp )->points[2][0], ( *pp )->points[2][1], ( *pp )->points[2][2],
706 ( *pp )->m_shader.c_str(),
707 ( *pp )->texInfo.m_texdef.shift[0], ( *pp )->texInfo.m_texdef.shift[1],
708 ( *pp )->texInfo.m_texdef.scale[0], ( *pp )->texInfo.m_texdef.scale[0],
709 ( *pp )->texInfo.m_texdef.rotate );
711 fprintf( pFile, "%s", buffer );
714 fprintf( pFile, "}\n" );
717 void DBrush::Rotate( vec3_t vOrigin, vec3_t vRotation ){
718 for ( std::list<DPlane *>::const_iterator rotPlane = faceList.begin(); rotPlane != faceList.end(); rotPlane++ )
720 for ( int i = 0; i < 3; i++ )
721 VectorRotate( ( *rotPlane )->points[i], vRotation, vOrigin );
723 ( *rotPlane )->Rebuild();
727 void DBrush::RotateAboutCentre( vec3_t vRotation ){
728 vec3_t min, max, centre;
729 GetBounds( min, max );
730 VectorAdd( min, max, centre );
731 VectorScale( centre, 0.5f, centre );
733 Rotate( centre, vRotation );
736 bool DBrush::ResetTextures( const char* textureName, float fScale[2], float fShift[2], int rotation, const char* newTextureName,
737 int bResetTextureName, int bResetScale[2], int bResetShift[2], int bResetRotation ){
739 bool changed = false;
740 for ( std::list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
742 if ( !strcmp( ( *resetPlane )->m_shader.c_str(), textureName ) ) {
743 if ( bResetTextureName ) {
744 ( *resetPlane )->m_shader = newTextureName;
747 if ( bResetScale[0] ) {
748 ( *resetPlane )->texInfo.m_texdef.scale[0] = fScale[0];
750 if ( bResetScale[1] ) {
751 ( *resetPlane )->texInfo.m_texdef.scale[1] = fScale[1];
754 if ( bResetShift[0] ) {
755 ( *resetPlane )->texInfo.m_texdef.shift[0] = fShift[0];
757 if ( bResetShift[1] ) {
758 ( *resetPlane )->texInfo.m_texdef.shift[1] = fShift[1];
761 if ( bResetRotation ) {
762 ( *resetPlane )->texInfo.m_texdef.rotate = (float)rotation;
768 return changed; // no point rebuilding unless we need to, only slows things down
772 for ( std::list<DPlane *>::const_iterator resetPlane = faceList.begin(); resetPlane != faceList.end(); resetPlane++ )
774 if ( bResetTextureName ) {
775 ( *resetPlane )->m_shader = newTextureName;
778 if ( bResetScale[0] ) {
779 ( *resetPlane )->texInfo.m_texdef.scale[0] = fScale[0];
781 if ( bResetScale[1] ) {
782 ( *resetPlane )->texInfo.m_texdef.scale[1] = fScale[1];
785 if ( bResetShift[0] ) {
786 ( *resetPlane )->texInfo.m_texdef.shift[0] = fShift[0];
788 if ( bResetShift[1] ) {
789 ( *resetPlane )->texInfo.m_texdef.shift[1] = fShift[1];
792 if ( bResetRotation ) {
793 ( *resetPlane )->texInfo.m_texdef.rotate = (float)rotation;
800 bool DBrush::operator ==( DBrush* other ){
801 std::list<DPlane *>::const_iterator chkPlane;
803 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
805 if ( !other->HasPlane( ( *chkPlane ) ) ) {
810 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ )
812 if ( !HasPlane( ( *chkPlane ) ) ) {
820 DPlane* DBrush::AddFace( const vec3_t va, const vec3_t vb, const vec3_t vc, const char *textureName, bool bDetail ){
821 bBoundsBuilt = false;
822 DPlane* newFace = new DPlane( va, vb, vc, textureName, bDetail );
823 faceList.push_back( newFace );
828 DPlane* DBrush::FindPlaneWithClosestNormal( vec_t* normal ) {
830 DPlane* bestDotPlane = NULL;
831 std::list<DPlane *>::const_iterator chkPlane;
832 for ( chkPlane = faceList.begin(); chkPlane != faceList.end(); chkPlane++ ) {
833 DPlane* pPlane = ( *chkPlane );
835 vec_t dot = DotProduct( pPlane->normal, normal );
836 if ( dot > bestDot ) {
838 bestDotPlane = pPlane;
845 int DBrush::FindPointsForPlane( DPlane* plane, DPoint** pnts, int maxpnts ) {
854 for ( std::list<DPoint *>::const_iterator points = pointList.begin(); points != pointList.end(); points++ ) {
855 DPoint* point = ( *points );
857 if ( fabs( plane->DistanceToPoint( point->_pnt ) ) < MAX_ROUND_ERROR ) {
858 pnts[numpnts] = point;
861 if ( numpnts >= maxpnts ) {
871 void DBrush::RemovePlane( DPlane* plane ) {
872 bBoundsBuilt = false;
873 for ( std::list<DPlane *>::const_iterator deadPlane = faceList.begin(); deadPlane != faceList.end(); deadPlane++ ) {
874 if ( *deadPlane == plane ) {
876 faceList.remove( plane );