![(please configure the [header_logo] section in trac.ini)](/trac/gametools/chrome/site/your_project_logo.png){kind=logo}
Changeset 390 for trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h
- Timestamp:
- 11/08/05 19:00:49 (19 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h
r384 r390 4 4 #include "Mesh.h" 5 5 #include "Containers.h" 6 #include "Polygon3.h" 6 7 #include <stack> 7 8 … … 11 12 class BspTree; 12 13 class BspInterior; 13 class Polygon3;14 //class Polygon3; 14 15 class AxisAlignedBox3; 15 16 class Ray; 17 18 class BspNodeGeometry 19 { 20 public: 21 BspNodeGeometry() 22 {}; 23 24 BspNodeGeometry(const PolygonContainer &polys, 25 const vector<Plane3> &planes, 26 const vector<bool> &sides); 27 BspNodeGeometry(const vector<Plane3> &planes, 28 const vector<bool> &sides); 29 30 ~BspNodeGeometry(); 31 32 float GetArea() const; 33 34 /** Computes new cell based on the old cell definition and a new split plane 35 @param side indicates which side of the halfspace 36 @returns true if plane contributes to the cell. 37 */ 38 BspNodeGeometry *ConstructChild(const BspTree &tree, 39 const Plane3 &splitPlane, 40 const bool side) const; 41 42 vector<Plane3> mPlanes; 43 vector<bool> mSides; 44 PolygonContainer mPolys; 45 }; 16 46 17 47 /** Data structure used for optimized ray casting. … … 176 206 public: 177 207 BspNode(); 178 virtual ~BspNode() ;208 virtual ~BspNode(){}; 179 209 BspNode(BspInterior *parent); 180 210 … … 192 222 */ 193 223 BspInterior *GetParent(); 224 194 225 /** Sets parent node. 195 226 */ 196 227 void SetParent(BspInterior *parent); 197 228 198 /** Returns pointer to polygons. 199 */ 200 PolygonContainer *GetPolygons(); 201 /** Stores polygons in node or discards them according to storePolys. 202 */ 203 void ProcessPolygons(PolygonContainer *polys, const bool storePolys); 204 229 205 230 static int mailID; 206 231 int mailbox; … … 210 235 bool Mailed() const { return mailbox == mailID; } 211 236 212 //int mViewCellIdx;213 237 protected: 214 238 215 239 /// parent of this node 216 240 BspInterior *mParent; 217 218 /// store polygons created during BSP splits219 PolygonContainer *mPolygons;220 241 }; 221 242 … … 247 268 @param backPolys returns the polygons in the back of the split plane 248 269 @param coincident returns the polygons coincident to the split plane 249 @param storePolys if the polygons should be stored in the node 250 270 251 271 @returns the number of splits 252 272 */ … … 254 274 PolygonContainer &frontPolys, 255 275 PolygonContainer &backPolys, 256 PolygonContainer &coincident, 257 const bool storePolys = false); 258 259 /** Stores polygon in node or discards them according to storePolys. 260 @param polys the polygons 261 @param storePolys if the polygons should be stored or discarded 262 */ 263 void ProcessPolygon(Polygon3 **poly, const bool storePolys); 276 PolygonContainer &coincident); 264 277 265 278 friend ostream &operator<<(ostream &s, const BspInterior &A) … … 337 350 /// rays piercing this node 338 351 BoundedRayContainer *mRays; 339 352 /// area of current node 353 float mArea; 354 BspNodeGeometry *mCell; 355 356 /// pvs size 357 int mPvs; 358 340 359 BspTraversalData(): 341 360 mNode(NULL), … … 343 362 mDepth(0), 344 363 mViewCell(NULL), 345 mRays(NULL) 364 mRays(NULL), 365 mPvs(0), 366 mArea(0.0), 367 mCell(NULL) 346 368 {} 347 369 … … 350 372 const int depth, 351 373 ViewCell *viewCell, 352 BoundedRayContainer *rays): 374 BoundedRayContainer *rays, 375 int pvs, 376 float area, 377 BspNodeGeometry *cell): 353 378 mNode(node), 354 379 mPolygons(polys), 355 380 mDepth(depth), 356 381 mViewCell(viewCell), 357 mRays(rays) 382 mRays(rays), 383 mPvs(pvs), 384 mArea(area), 385 mCell(cell) 358 386 {} 359 387 }; … … 445 473 void ConstructGeometry(BspViewCell *vc, PolygonContainer &cell) const; 446 474 475 void ConstructGeometry(BspNode *n, BspNodeGeometry &cell) const; 476 447 477 /** Returns random leaf of BSP tree. 448 478 @param halfspace defines the halfspace from which the leaf is taken. … … 454 484 */ 455 485 BspLeaf *GetRandomLeaf(const bool onlyUnmailed = false); 456 457 /** Computes new cell based on the old cell definition and a new split plane458 @param side indicates which side of the halfspace459 @returns true if plane contributes to the cell.460 */461 bool ConstructChildGeometry(PolygonContainer &childCell,462 const PolygonContainer &cell,463 const vector<Plane3 *> &planes,464 const vector<bool> &sides,465 const Plane3 &splitPlane,466 const bool side) const;467 468 486 469 487 /** Returns true if merge criteria are reached. … … 530 548 */ 531 549 Plane3 SelectPlane(BspLeaf *leaf, 532 PolygonContainer &polys, 533 const BoundedRayContainer &ray); 550 BspTraversalData &data, 551 BspTraversalData &frontData, 552 BspTraversalData &backData); 534 553 535 554 /** Evaluates the contribution of the candidate split plane. … … 542 561 */ 543 562 float SplitPlaneCost(const Plane3 &candidatePlane, 544 const PolygonContainer &polys, 545 const BoundedRayContainer &rays, 546 const PolygonContainer &cell, 547 const vector<Plane3 *> &plane, 548 const vector<bool> &sides, 549 const int pvsSize) const; 563 BspTraversalData &data, 564 BspTraversalData &frontData, 565 BspTraversalData &backData) const; 550 566 551 567 /** Strategies where the effect of the split plane is tested … … 557 573 558 574 /** Strategies where the effect of the split plane is tested 559 on all input polygons.575 on all input rays. 560 576 561 577 @returns the cost of the candidate split plane 562 578 */ 563 float SplitPlaneCost(const Plane3 &candidatePlane, 579 float SplitPlaneCost(const Plane3 &candidatePlane, 564 580 const BoundedRayContainer &rays, 565 const float frontArea, 566 const float backArea, 567 const int pvsSize) const; 581 const int pvs, 582 const float area, 583 const BspNodeGeometry &cell, 584 BspTraversalData &frontData, 585 BspTraversalData &backData) const; 568 586 569 587 /** Filters next view cell down the tree and inserts it into the appropriate leaves … … 589 607 @returns the root of the subdivision 590 608 */ 591 BspInterior *SubdivideNode(BspLeaf *leaf, 592 PolygonContainer &polys, 593 PolygonContainer &frontPolys, 594 PolygonContainer &backPolys, 595 PolygonContainer &coincident, 596 BoundedRayContainer &rays, 597 BoundedRayContainer &frontRays, 598 BoundedRayContainer &backRays); 609 610 BspInterior *SubdivideNode(BspTraversalData &tData, 611 BspTraversalData &frontData, 612 BspTraversalData &backData, 613 PolygonContainer &coincident); 599 614 600 615 /** Filters polygons down the tree. … … 614 629 @param polygons container of polygons 615 630 @param rays bundle of rays on which the split can be based 616 @param maxPolyCandidates the maximal number of tested polygon candidates617 @param maxRayCandidates the maximal number of ray candidates618 631 */ 619 632 Plane3 SelectPlaneHeuristics(BspLeaf *leaf, 620 PolygonContainer &polys, 621 const BoundedRayContainer &rays, 622 const int maxPolyCandidates, 623 const int maxRayCandidates); 633 BspTraversalData &data, 634 BspTraversalData &frontData, 635 BspTraversalData &backData); 624 636 625 637 /** Extracts the meshes of the objects and adds them to polygons. … … 663 675 @param extractFront if a front view cell is extracted 664 676 */ 665 void ExtractViewCells( ViewCell **backViewCell,666 ViewCell **frontViewCell,677 void ExtractViewCells(BspTraversalData &frontData, 678 BspTraversalData &backData, 667 679 const PolygonContainer &coincident, 668 const Plane3 splitPlane, 669 const bool extractBack, 670 const bool extractFront) const; 680 const Plane3 splitPlane) const; 671 681 672 682 /** Computes best cost ratio for the suface area heuristics for axis aligned … … 723 733 /** Extracts the split planes representing the space bounded by node n. 724 734 */ 725 void ExtractSplitPlanes(BspNode *n, vector<Plane3 *> &planes, vector<bool> &sides) const;735 void ExtractSplitPlanes(BspNode *n, vector<Plane3> &planes, vector<bool> &sides) const; 726 736 727 737 /** Computes the pvs of the front and back leaf with a given classification. 728 738 */ 729 739 void AddToPvs(Intersectable &obj, 730 float &frontPvs,731 float &backPvs,732 733 734 735 740 int &frontPvs, 741 int &backPvs, 742 const int cf, 743 const int frontId, 744 const int backId, 745 const int frontAndBackId) const; 736 746 737 747 int ComputePvsSize(const BoundedRayContainer &rays) const; … … 779 789 /// maximal possible depth 780 790 static int sTermMaxDepth; 791 /// mininam pvs 792 static int sTermMinPvs; 781 793 /// strategy to get the best split plane 782 794 static int sSplitPlaneStrategy; … … 809 821 static float sPvsFactor; 810 822 811 /// if polygons should be stored in the tree812 static bool sStoreSplitPolys;813 814 823 //-- thresholds used for view cells are merging 815 824 static int sMinPvsDif;
Note: See TracChangeset
for help on using the changeset viewer.
