source: GTP/trunk/Lib/Vis/Preprocessing/src/ViewCell.h @ 1264

Revision 1264, 18.0 KB checked in by mattausch, 18 years ago (diff)
RevLine 
[372]1#ifndef _ViewCell_H__
2#define _ViewCell_H__
3
4#include "Mesh.h"
5#include "Containers.h"
6#include "Ray.h"
[462]7#include "Statistics.h"
[608]8#include "Material.h"
[955]9#include "gzstream.h"
[469]10
[1010]11
[860]12namespace GtpVisibilityPreprocessor {
13
[469]14struct Triangle3;
15
[372]16class BspInterior;
17class BspPvs;
18class BspLeaf;
[1008]19class VspLeaf;
[469]20class KdLeaf;
[580]21class ViewCellInterior;
22class MergeCandidate;
23class ViewCellsManager;
[881]24class ViewCellLeaf;
[372]25
[955]26
[1264]27
[479]28/** Statistics for a view cell partition.
29*/
30
31class ViewCellsStatistics: public StatisticsBase
32{
33public:
34
35        /// number of view cells
36        int viewCells;
37
38        /// size of the PVS
[613]39        int pvsSize;
[479]40
41        /// largest PVS of all view cells
42        int maxPvs;
43
44        /// smallest PVS of all view cells
45        int minPvs;
46
47        /// view cells with empty PVS
48        int emptyPvs;
49
50        /// number of leaves covering the view space
51        int leaves;
52
53        /// largest number of leaves covered by one view cell
54        int maxLeaves;
55
[564]56        int invalid;
57
[479]58    // Constructor
59        ViewCellsStatistics()
60        {
61                Reset();
62        }
63
64        double AvgLeaves() const {return (double)leaves / (double)viewCells;};
[613]65        double AvgPvs() const {return (double)pvsSize / (double)viewCells;};
[479]66
67        void Reset()
68        {
69                viewCells = 0;
[613]70                pvsSize = 0;
[479]71                maxPvs = 0;
72
73                minPvs = 999999;
74                emptyPvs = 0;
75                leaves = 0;
76                maxLeaves = 0;
[564]77                invalid = 0;
[479]78        }
79
80        void Print(ostream &app) const;
81
82        friend ostream &operator<<(ostream &s, const ViewCellsStatistics &stat)
83        {
84                stat.Print(s);
85                return s;
86        }
87};
88
[580]89
[372]90/**
91        View cell with an optional mesh representation
92*/
[580]93
94
[372]95class ViewCell: public MeshInstance
96{
[752]97        friend class ViewCellsTree;
98        friend class ViewCellsManager;
99
[372]100public:
101        ViewCell();
[471]102
[372]103        /** Constructor taking a mesh representing the shape of the viewcell.
104        */
105        ViewCell(Mesh *mesh);
[462]106
[469]107        /** Default destructor.
108        */
[462]109        virtual ~ViewCell() {}
[580]110
[471]111        /** Returns Pvs.
[372]112        */
[469]113        const ObjectPvs &GetPvs() const;
[752]114
[1002]115        /** Returns pvs.
116        */
[469]117        ObjectPvs &GetPvs();
[372]118
[1002]119        /** Completely substitutes the pvs.
120        */
[880]121        void SetPvs(const ObjectPvs &pvs);
122
[752]123        /** Type of view cells.
124        */
[372]125        int Type() const;
[471]126
[1002]127       
[372]128        /** Adds a passing ray to the passing ray container.
129        */
[471]130        void AddPassingRay(const Ray &ray, const int contributions);
[372]131
[469]132        /** Returns volume of the view cell.
133        */
[478]134        float GetVolume() const;
[372]135
[478]136        /** Returns area of the view cell.
[469]137        */
[478]138        float GetArea() const;
[469]139
[478]140        /** Sets the volume of the view cell.
141        */
142        void SetVolume(float volume);
143       
144        /** Sets the area of the view cell.
145        */
146        void SetArea(float area);
[503]147
[478]148
[580]149        /** if this view cell is the root of a view cell hierarchy
150        */
151        bool IsRoot() const;
[372]152
[580]153        /** Returns parent view cell.
154        */
155        ViewCellInterior *GetParent() const;
[372]156
[1002]157        /** Sets parent of this view cell.
158        */
159        void SetParent(ViewCellInterior *parent);
160
161
[503]162        /** Sets the mesh for this view cell.
163        */
164        void SetMesh(Mesh *mesh);
165
[1002]166        /** Sets this view cell to be a valid view cell according to some criteria.
167        */
[547]168        void SetValid(const bool valid);
[1002]169        /** Returns true if this view cell is considered to be valid according to
170                some criteria.
171        */
[547]172        bool GetValid() const;
173
[728]174        /** Returns estimated render cost of this view cell.
175        */
176        float GetRenderCost() const;
[580]177
[752]178        /** set color for visiualizations.
179        */
180        void SetColor(const RgbColor &color);
[580]181
[752]182        /** get color for visualuzations.
183        */
184    RgbColor GetColor() const;
[580]185
[1002]186        /** Adds a sample to the pvs.
187                @param sample the sample to be added
188                @param pdf a continuos measure of visibility
189                @param contribution returns the contribution of this sample to the pvs
190        */
191        bool AddPvsSample(Intersectable *sample, const float pdf, float &contribution);
[608]192 
[580]193
194        /// Rays piercing this view cell.
195        RayContainer mPiercingRays;
196
197
198        /** if this is a view cell correspending to a leaf in a hierarchy.
199        */
200        virtual bool IsLeaf() const = 0;
201
[752]202        static bool SmallerPvs(const ViewCell *a, const ViewCell *b)
203        {
[997]204                // HACK: take scalar value because pvs may not have been stored properly
205#if 1
206                return a->mPvsSize < b->mPvsSize;
207#else
[1168]208                return a->GetPvs().CountObjectsInPvs() < b->GetPvs().CountObjectsInPvs();
[997]209#endif
210        }
[569]211
[997]212        static bool SmallerRenderCost(const ViewCell *a, const ViewCell *b)
213        {
214                return a->GetRenderCost() < b->GetRenderCost();
215        }
[580]216
[997]217        static bool LargerRenderCost(const ViewCell *a, const ViewCell *b)
218        {
219                return a->GetRenderCost() > b->GetRenderCost();
220        }
[801]221
[1002]222        /** Sets merge cost used for merging this view cell from other cells.
223                @hack The function is available for leaves also to have a common interface,
224                but it should be less than zero for leaves.
225                */
[600]226        void SetMergeCost(const float mergeCost);
[997]227
[1002]228        /** Returns merge cost needed to merge this leaf from other cells.
229                @hack The function is available for leaves also to have a common interface,
230                but it should be less than zero for leaves.
231        */
[600]232        float GetMergeCost() const;
[997]233
[1002]234
235
236        ////////////////////////////////////////////
237        //       mailing stuff
238
239
[997]240        static void NewMail(const int reserve = 1)
241        {
[580]242                sMailId += sReservedMailboxes;
243                sReservedMailboxes = reserve;
244        }
[997]245
[580]246        void Mail() { mMailbox = sMailId; }
247        bool Mailed() const { return mMailbox == sMailId; }
248
249        void Mail(const int mailbox) { mMailbox = sMailId + mailbox; }
250        bool Mailed(const int mailbox) const { return mMailbox == sMailId + mailbox; }
251
[1145]252        int IncMail() { return ++ mMailbox - sMailId; }
[580]253
254
255        // last mail id -> warning not thread safe!
256        // both mailId and mailbox should be unique for each thread!!!
257        static int sMailId;
258        static int sReservedMailboxes;
259
[609]260       
[372]261protected:
262
[1002]263        /// parent view cell in the view cell hierarchy
264        ViewCellInterior *mParent;
265
[372]266        /// the potentially visible objects
[469]267        ObjectPvs mPvs;
[1160]268        /// the volume of this view cell
[469]269        float mVolume;
[478]270        float mArea;
[1160]271        /// the cost that were paid for merging this view cells from two others.
[600]272        float mMergeCost;
[1160]273        /// if the view cell is valid view space
[547]274        bool mValid;
[608]275
[881]276        /// color used for consistent visualization
[660]277        RgbColor mColor;
[752]278
[1002]279        /// store pvs size, used for evaluation purpose when pvss are stored only in the leaves
[752]280        int mPvsSize;
[1161]281        /** stores number of entries in pvs
282            this variable has the same value as mPvsSize for object pvs,
283                but usually not for kd cell based pvs
284        */
[1160]285        int mEntriesInPvs;
286
[1161]287        /// if the pvs size scalar (+ entries into pvs)
288        /// is up to date and corresponding to the real pvs size
[752]289        bool mPvsSizeValid;
[372]290};
291
[580]292
293class ViewCellInterior: public ViewCell
294{
[752]295        friend class ViewCellsManager;
[580]296public:
297        ViewCellInterior();
298        ~ViewCellInterior();
299
300        ViewCellInterior(Mesh *mesh);
301       
302
303        /** Sets pointer from parent to child and vice versa.
304        */
305        void SetupChildLink(ViewCell *l);
[586]306        void RemoveChildLink(ViewCell *l);
[580]307        bool IsLeaf() const;
308
309        ViewCellContainer mChildren;
310
[608]311  void SetCost(const float c) {
312        mCost = c;
313  }
314  float GetCost() const {
315        return mCost;
316  }
317 
318protected:
319  /** overall cost resulting from the merge */
320  float mCost;
[580]321};
322
[881]323
[469]324/**
[881]325        Leaf of the view cell.
[469]326*/
[580]327class ViewCellLeaf: public ViewCell
[366]328{
329public:
[881]330        ViewCellLeaf()  {  mActiveViewCell = this; }
331        ViewCellLeaf(Mesh *mesh):
332        ViewCell(mesh) { mActiveViewCell = this; }
[469]333
[881]334        bool IsLeaf() const
335        {
336                return true;
337        }
338
339        /** Returns if this view cell is active.
340        */
341        ViewCell *GetActiveViewCell() const
342        { return mActiveViewCell; }
343
344        /** Sets this view cell to be an active view cell.
345        */
346        void SetActiveViewCell(ViewCell *vc)
347        { mActiveViewCell = vc;}
348
[605]349       
[997]350        /** points to the currently active view cell. This is the
351                view cell representing the current brach.
352        */
[881]353        ViewCell *mActiveViewCell;
354};
[479]355
[1121]356/** Leaf of the view cell hierarchy corresponding
357        to a leaf in a spatial hierarchy.
[881]358*/
359template<typename T>
360class HierarchyLeafViewCell: public ViewCellLeaf
361{
362public:
363
364        HierarchyLeafViewCell<T>(): ViewCellLeaf() {  }
365        HierarchyLeafViewCell<T>(Mesh *mesh):
366        ViewCellLeaf(mesh) {  }
367               
368
[580]369        bool IsLeaf() const
370        {
371                return true;
372        }
373
[881]374
[580]375        /// Leaf of some hierarchy which is part of this view cell.
376        T mLeaf;
[469]377};
378
[479]379
[1010]380typedef HierarchyLeafViewCell<VspLeaf *> VspViewCell;
[881]381typedef HierarchyLeafViewCell<BspLeaf *> BspViewCell;
382typedef HierarchyLeafViewCell<KdLeaf *> KdViewCell;
[469]383
[366]384
[580]385
[1008]386
[580]387class ViewCellsTree
388{
[600]389        friend class ViewCellsManager;
[1263]390        friend class ViewCellsParseHandlers;
[752]391
[580]392public:
[1264]393        ViewCellsTree();
[1004]394        /** View cells tree constructor taking a view cell mnanager as parameter
[997]395        */
[1004]396        ViewCellsTree(ViewCellsManager *vcm);
[580]397        ~ViewCellsTree();
398
399        /** Returns number of leaves this view cell consists of.
400        */
[736]401        int GetNumInitialViewCells(ViewCell *vc) const;
[580]402
403        /** Collects leaves corresponding to a view cell.
404        */
405        void CollectLeaves(ViewCell *vc, ViewCellContainer &leaves) const;
406
407        /** Merges view cells according to some cost heuristics.
408        */
409        int ConstructMergeTree(const VssRayContainer &rays, const ObjectContainer &objects);
410       
411        /** Refines view cells using shuffling, i.e., border leaves
412                of two view cells are exchanged if the resulting view cells
413                are tested to be "better" than the old ones.
414                @returns number of refined view cells
415        */
416        int RefineViewCells(const VssRayContainer &rays, const ObjectContainer &objects);
[651]417       
418        /** Assign colors to the viewcells so that they can be renderered interactively without
[997]419            color flickering. 
420        */
[651]421        void AssignRandomColors();
[580]422
[997]423        /** Updates view cell stats for this particular view cell.
[605]424        */
425        void UpdateViewCellsStats(ViewCell *vc, ViewCellsStatistics &vcStat);
[580]426
[997]427        /** Get costs resulting from each merge step.
428        */
[651]429        void GetCostFunction(vector<float> &costFunction);
[608]430 
[580]431        /** Returns optimal set of view cells for a given number of view cells.
432        */
433        void CollectBestViewCellSet(ViewCellContainer &viewCells, const int numViewCells);
434
[581]435        /** Root of view cells tree.
436        */
[584]437        ViewCell *GetRoot() const;
[581]438
[584]439        /** Returns pvs of view cell.
440                @note pvs is returned per reference if tree is not compressed,
441                per copy else.
442        */
443        void GetPvs(ViewCell *vc, ObjectPvs &pvs) const;
444
[1161]445        /** Returns pvs size (i.e. the number of stored objects
[584]446        */
[1142]447        int GetPvsSize(ViewCell *vc) const;
[584]448
[1161]449        /** Returns number of entries associated with this view cell.
450                This returns the same value as the GetPvsSize function for object pvs,
451                but most likely different values for kd node based pvs.
[584]452        */
[1161]453        int GetPvsEntries(ViewCell *vc) const;
[584]454
[1161]455        /** Returns the actual number of stored entries in the view cells sub tree.
456        */
457        int GetStoredPvsEntriesNum(ViewCell *root) const;
458
[584]459        /** Returns memory cost of this view cell.
460        */
461        float GetMemoryCost(ViewCell *vc) const;
462
[752]463        /** Sets method of storage for view cells.
[584]464        */
[752]465        void SetViewCellsStorage(int type);
[584]466
[837]467        /** pvs storage methods
468        */
[752]469        enum {PVS_IN_INTERIORS, COMPRESSED, PVS_IN_LEAVES};
470
[840]471       
[584]472        /** If view cells in this tree have compressed pvs.
473        */
[752]474        int ViewCellsStorage() const;
[584]475
[660]476        /** Returns active view cell that is in the path of this view cell.
477        */
[881]478        ViewCell *GetActiveViewCell(ViewCellLeaf *vc) const;
[590]479
[660]480        /** Sets the leaves to be the currently active view cells.
481        */
482    void SetActiveSetToLeaves();
483
[651]484        /** Propagates pvs up the tree to the root and downwards the tree.
[610]485        */
[651]486        void PropagatePvs(ViewCell *vc);
[610]487
[837]488        /** Exports view cells to file.
489        */
[1201]490        bool Export(OUT_STREAM &stream, const bool exportPvs = false);
[610]491
[649]492        /** Export statistics of this view cell tree.
493        */
[660]494        void ExportStats(const string &mergeStats);
[610]495
[650]496        /** Sets root of hierarchy.
497        */
498        void SetRoot(ViewCell *root);
499
500        //float ComputeVolume(ViewCell *vc);
501
[651]502        /** Assignes unique ids to view cells.
503        */
504        void CreateUniqueViewCellsIds();
505
[660]506        /** Resets pvs of whole tree.
507        */
508        void ResetPvs();
[651]509
[1121]510        /** Counts pvs of the view cell taking the kd cells into account.
511        */
512        int CountKdPvs(const ViewCellLeaf *vc) const;
513
[1264]514        void SetViewCellsManager(ViewCellsManager *vcm)
515        {
516                mViewCellsManager = vcm;
517        }
518
[580]519protected:
520
[1264]521        void ReadEnvironment();
[580]522
[997]523        /////////////////////////////////////////////////////////////////
524        //                    merge related stuff                      //
525        /////////////////////////////////////////////////////////////////
[580]526
[729]527        /** Computes render cost of the merged pvs.
528        */
529        float ComputeMergedPvsCost(const ObjectPvs &pvs1, const ObjectPvs &pvs2) const;
530
[580]531        /** Returns cost of this leaf according to current heuristics.
532        */
533        float GetCostHeuristics(ViewCell *vc) const;
534
535        /** Returns cost of leaf.
536        */
537        float GetRenderCost(ViewCell *vc) const;
538
539        /** Evaluates the merge cost of this merge candidate pair.
540        */
541        void EvalMergeCost(MergeCandidate &mc) const;
542
543        /** Variance of leaf.
544        */
545        float GetVariance(ViewCell *vc) const;
546
547        /** Standard deviation of leaf.
548        */
549        float GetDeviation(ViewCell *vc) const;
550
[582]551        /** Tries to set this merge candidate to valid.
552                @returns false if both view cells are the same
[580]553        */
[582]554        bool ValidateMergeCandidate(MergeCandidate &mc) const;
[580]555
556        /** Merge view cells of leaves l1 and l2.
557                @returns difference in pvs size
558        */
559        ViewCellInterior *MergeViewCells(ViewCell *l, ViewCell *r, int &pvsDiff); //const;
560
561        /** Shuffles, i.e. takes border leaf from view cell 1 and adds it
562                to view cell 2.
563        */
[586]564        void ShuffleLeaf(ViewCell *leaf, ViewCellInterior *vc1, ViewCellInterior *vc2) const;   
[580]565               
566        /** Shuffles the leaves, i.e., tests if exchanging
567                the leaves helps in improving the view cells.
568        */
[586]569        bool ShuffleLeaves(MergeCandidate &mc) const;
[580]570
571        /** Calculates cost for merge of view cell 1 and 2.
572        */
[586]573        float EvalShuffleCost(ViewCell *leaf,
574                                                  ViewCellInterior *vc1,
575                                                  ViewCellInterior *vc2) const;
[580]576
577        /** Exports a snapshot of the merged view cells to disc.
578        */
579        void ExportMergedViewCells(ViewCellContainer &viewCells,
580                                                           const ObjectContainer &objects,
581                                                           const int numNewViewCells);
582
[997]583        /** Merge queue must be reset after some time because expected value
[580]584                may not be valid.
585        */
586        void ResetMergeQueue();
587
588        /** Updates the current top level of view cells.
[582]589                @returns number of newly merged view cells
[580]590        */
[582]591        int UpdateActiveViewCells(ViewCellContainer &viewCells);
[580]592
[997]593        /** Helper function pullling pvs as high up in the tree as possible.
594        */
[610]595        void PullUpVisibility(ViewCellInterior *interior);
[580]596
[997]597        /** Compress pvs of view cell and children.
598        */
[584]599        void CompressViewCellsPvs(ViewCell *root);
[580]600
[582]601        /** Returns memory usage of view cells.
602        */
603        float GetMemUsage() const;
[837]604
605        /**     Exports single view cell.
[610]606                NOTE: should be in exporter!!
607        */
[1201]608        void ExportViewCell(ViewCell *viewCell, OUT_STREAM &stream, const bool exportPvs);     
[581]609
[837]610        /** Exports pvs of a view cell.
611        */
[1201]612        void ExportPvs(ViewCell *viewCell, OUT_STREAM &stream);
[582]613
[1166]614        int GetEntriesInPvsForCompressedStorage(ViewCell *vc) const;
615        int GetPvsSizeForCompressedStorage(ViewCell *vc) const;
616        int GetPvsSizeForLeafStorage(ViewCell *vc) const;
617        int GetEntriesInPvsForLeafStorage(ViewCell *vc) const;
[610]618
[1166]619        void UpdateStats(
620                ofstream &stats,
621                const int pass,
622                const int viewCells,
623                const float renderCostDecrease,
624                const float totalRenderCost,
625                const int currentPvs,
626                const float expectedCost,
627                const float avgRenderCost,
628                const float deviation,
629                const int totalPvs,
630                const int entriesInPvs,
631                const int pvsSizeDecr,
632                const float volume);
633
[584]634        /// if the view cell tree hold compressed pvs
[752]635        int mViewCellsStorage;
[582]636
[580]637        ViewCellsManager *mViewCellsManager;
638        ViewCell *mRoot;
639
640        /// if merge visualization should be shown
641        bool mExportMergedViewCells;
642
643       
[837]644        /// intermediate container of merged view cells.
[582]645        ViewCellContainer mMergedViewCells;
646       
[580]647
[837]648        /// if merged view cells are refined.
[586]649        bool mRefineViewCells;
650
[580]651        /// weights between variance and render cost increase (must be between zero and one)
652        float mRenderCostWeight;
653
654        /// overall cost used to normalize cost ratio
655        float mOverallCost;
656        float mExpectedCost;
657    float mDeviation;
658        float mAvgRenderCost;
[837]659        /// the area is used for pvs heuristics
[580]660        int mUseAreaForPvs;
661
[582]662        int mNumActiveViewCells;
[580]663
664        /// minimal number of view cells
665        int mMergeMinViewCells;
666        /// maximal cost ratio for the merge
667        float mMergeMaxCostRatio;
668
669        typedef priority_queue<MergeCandidate> MergeQueue;
670
671        MergeQueue mMergeQueue;
672
[582]673        float mMaxMemory;
[580]674
[938]675        int mMaxMergesPerPass;
676        float mAvgCostMaxDeviation;
[580]677};
678
679
680/**
681        Candidate for leaf merging based on priority.
682*/
683class MergeCandidate
684
685        friend class ViewCellsTree;
686
687public:
688
689        MergeCandidate(ViewCell *l, ViewCell *r);
690
691        /** If this merge pair is still valid.
692        */
693        bool IsValid() const;
694
695       
696        friend bool operator<(const MergeCandidate &leafa, const MergeCandidate &leafb)
697        {
698                return leafb.GetMergeCost() < leafa.GetMergeCost();
699        }
700
701        void SetLeftViewCell(ViewCell *l);
702        void SetRightViewCell(ViewCell *l);
703
704        ViewCell *GetLeftViewCell() const;
705        ViewCell *GetRightViewCell() const;
706
[703]707        /** Returns leaf view cell initially associated with this merge candidate.
708        */
[580]709        ViewCell *GetInitialLeftViewCell() const;
[1133]710        /** Returns leaf view cell initially associated with this merge candidate.
711        */
[580]712        ViewCell *GetInitialRightViewCell() const;
713
714        /** Returns the increase of the standard deviation of this merge candidate.
715        */
716        float GetDeviationIncr() const;
717
718        /** Merge cost of this candidate pair.
719        */
720        float GetMergeCost() const;
721
722        /** Render cost of this candidate.
723        */
724        float GetRenderCost() const;
725       
726        static float sRenderCostWeight;
727
728protected:
729
730        /// render cost increase by this merge
731        float mRenderCost;
732        /// increase / decrease of standard deviation
733        float mDeviationIncr;
734
735        ViewCell *mLeftViewCell;
736        ViewCell *mRightViewCell;
737
738        ViewCell *mInitialLeftViewCell;
739        ViewCell *mInitialRightViewCell;
740};
741
742
743class MergeStatistics: public StatisticsBase
744{
745public:
746       
747        int merged;
748        int siblings;
749        int candidates;
750        int nodes;
751
752        int accTreeDist;
753        int maxTreeDist;
754       
755        Real collectTime;
756        Real mergeTime;
757
758        Real overallCost;
759
760        Real expectedRenderCost;
761        Real deviation;
762        Real heuristics;
763
764        // Constructor
765        MergeStatistics()
766        {
767                Reset();
768        }
769       
770        double AvgTreeDist() const {return (double)accTreeDist / (double)merged;};
771
772        void Reset()
773        {
774                nodes = 0;
775                merged = 0;
776                siblings = 0;
777                candidates = 0;
778       
779                accTreeDist = 0;
780                maxTreeDist = 0;
781
782                collectTime = 0;
783                mergeTime = 0;
784                overallCost = 0;
785
786                expectedRenderCost = 0;
787                deviation = 0;
788                heuristics = 0;
789
790        }
791
792        void Print(ostream &app) const;
793
794        friend ostream &operator<<(ostream &s, const MergeStatistics &stat)
795        {
796                stat.Print(s);
797                return s;
798        }
799};
800
[860]801}
802
[372]803#endif
Note: See TracBrowser for help on using the repository browser.