source: trunk/VUT/GtpVisibilityPreprocessor/src/RenderSimulator.cpp @ 418

Revision 418, 5.3 KB checked in by mattausch, 19 years ago (diff)
Line 
1#include "RenderSimulator.h"
2#include "KdTree.h"
3#include "ViewCellBsp.h"
4#include "ViewCell.h"
5
6void SimulationStatistics::Print(ostream &app) const
7{
8        app << "===== Simulation statistics ===============\n";
9
10        app << setprecision(4);
11
12        app << "#N_CTIME  ( Simulation time [s] )\n" << Time() << " \n";
13
14        app << "#MAX_COST ( maximal cost of a view cell )\n" << maxCost << "\n";
15
16        app << "#MIN_COST ( minimal cost of a view cell )\n" << minCost << "\n";
17
18        app << "#AVG_RENDER_TIME ( average render time )\n" << avgRenderTime << "\n";
19
20        app << "#AVG_RENDER_TIME_NO_OVERHEAD ( average render time without overhead )\n" << avgRtWithoutOverhead << "\n";
21       
22        app << "===== END OF Simulation statistics ==========\n";
23}
24
25RenderSimulator::RenderSimulator()
26{}
27
28RenderSimulator::RenderSimulator(float objRenderCost, float vcOverhead, float moveSpeed):
29mObjRenderCost(objRenderCost), mVcOverhead(vcOverhead), mMoveSpeed(moveSpeed)
30{
31}
32
33/*****************************************************
34 *     class ViewCellRenderSimulator implementation  *
35 *****************************************************/
36
37BspViewCellRenderSimulator::BspViewCellRenderSimulator(float objRenderCost,
38                                                                                           float vcOverhead,
39                                                                                           float moveSpeed,
40                                                                                           BspTree *bspTree):
41RenderSimulator(objRenderCost, vcOverhead, moveSpeed), mBspTree(bspTree)
42{
43}
44
45Real BspViewCellRenderSimulator::SimulateRendering()
46{
47        mStat.Reset();
48        mStat.Start();
49
50        Real renderTime = 0;
51       
52        // overhead for loading the PVS of the view cells
53        float loadPvsOverhead = 0;
54        // probability that view point lies in a view cell
55        float pInVcTotal = 0;
56
57        // total probability that a view cell border is crossed
58        const float pCrossVcTotal = mBspTree->GetBoundingBox().SurfaceArea();
59
60        // collect all view cells
61        ViewCellContainer viewCells;
62        mBspTree->CollectViewCells(viewCells);
63
64        ViewCellContainer::const_iterator it, it_end = viewCells.end();
65
66        // surface area substitute for probability
67        PolygonContainer geom;
68
69        for (it = viewCells.begin(); it != it_end; ++ it)
70        {
71                // compute view cell area
72                mBspTree->ConstructGeometry(dynamic_cast<BspViewCell *>(*it), geom);
73                const float area = Polygon3::GetArea(geom);
74                CLEAR_CONTAINER(geom);
75
76                // area substitute for view point probability
77                float pInVc = area;
78                               
79                // compute render time of PVS times probability that view point is in view cell
80                float vcCost = pInVc * RenderPvs(*(*it), mObjRenderCost);
81                //Debug << "p: " << pInVc << " rendercost: " << RenderPvs(*(*it), mObjRenderCost) << endl;
82                renderTime += vcCost;
83
84                if (vcCost > mStat.maxCost)
85                        mStat.maxCost = vcCost;
86                else if (vcCost < mStat.minCost)
87                        mStat.minCost = vcCost;
88
89                // probability that a view cell border is crossed
90                float pCrossVc = area * mMoveSpeed;
91
92                // crossing the border of a view cell is also depending on the move speed
93                loadPvsOverhead += pCrossVc * mVcOverhead;
94
95                pInVcTotal += pInVc;
96        }
97
98       
99        renderTime /= pInVcTotal;
100        loadPvsOverhead /= pCrossVcTotal;
101
102        mStat.avgRtWithoutOverhead = renderTime;
103        mStat.avgRenderTime = renderTime + loadPvsOverhead;
104       
105        mStat.Stop();
106
107        return renderTime + loadPvsOverhead;
108}
109
110Real BspViewCellRenderSimulator::RenderPvs(ViewCell &viewCell,
111                                                                           float objRenderTime) const
112{
113        return viewCell.GetPvs().GetSize() * objRenderTime;
114}
115
116/********************************************************
117 *     class KdLeafRenderSimulator implementation       *
118 *******************************************************/
119
120KdViewCellRenderSimulator::KdViewCellRenderSimulator(float objRenderCost,
121                                                                                         float vcOverhead,
122                                                                                         float moveSpeed,
123                                                                                         KdTree *kdTree):
124RenderSimulator(objRenderCost, vcOverhead, moveSpeed), mKdTree(kdTree)
125{
126}
127
128Real KdViewCellRenderSimulator::SimulateRendering()
129{
130        //mKdTree->CollectLeavesPvs();
131        mStat.Reset();
132        mStat.Start();
133
134        // total render time
135        Real renderTime = 0;
136        // overhead for loading a view cell
137        float loadPvsOverhead = 0;
138
139        // probability that view point lies in a view cell
140        float pInVcTotal = 0;//mKdTree->GetBox().GetVolume();
141
142        // total probability that a view cell border is crossed
143        const float pCrossVcTotal = mKdTree->GetBox().SurfaceArea();
144
145        vector<KdLeaf *> leaves;
146        mKdTree->CollectLeaves(leaves);
147       
148        AxisAlignedBox3 box;
149
150        vector<KdLeaf *>::const_iterator it, it_end = leaves.end();
151       
152        for (it = leaves.begin(); it != it_end; ++ it)
153        {
154                box = mKdTree->GetBox(*it);
155                       
156                // volume substitute for view point probability
157                float pInVc = 0;
158               
159                if (0)
160                        pInVc = box.GetVolume();
161                else
162                        pInVc = box.SurfaceArea();
163               
164                float vcCost = pInVc * RenderPvs(*it, mObjRenderCost);
165                renderTime += vcCost;
166
167                if (vcCost > mStat.maxCost)
168                        mStat.maxCost = vcCost;
169                else if (vcCost < mStat.minCost)
170                        mStat.minCost = vcCost;
171
172                // probability that a view cell border is crossed
173                const float pCrossVc = box.SurfaceArea() * mMoveSpeed;
174
175                loadPvsOverhead += pCrossVc * mVcOverhead;
176
177                pInVcTotal += pInVc;
178        }
179
180        renderTime /= pInVcTotal;
181        loadPvsOverhead /= pCrossVcTotal;
182
183    mStat.avgRtWithoutOverhead = renderTime;
184        mStat.avgRenderTime = renderTime + loadPvsOverhead;
185       
186        mStat.Stop();
187
188        return renderTime + loadPvsOverhead;
189}
190
191Real KdViewCellRenderSimulator::RenderPvs(KdLeaf *leaf,
192                                                                                   float objRenderTime) const
193{
194        return leaf->mKdPvs.GetSize() * objRenderTime;
195}
Note: See TracBrowser for help on using the repository browser.