1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
#include "viewdata.hpp"
#include "quadtreenode.hpp"
#include <algorithm>
namespace Terrain
{
ViewData::ViewData()
: mNumEntries(0)
, mLastUsageTimeStamp(0.0)
, mChanged(false)
, mHasViewPoint(false)
, mWorldUpdateRevision(0)
{
}
ViewData::~ViewData() {}
void ViewData::copyFrom(const ViewData& other)
{
mNumEntries = other.mNumEntries;
mEntries = other.mEntries;
mChanged = other.mChanged;
mHasViewPoint = other.mHasViewPoint;
mViewPoint = other.mViewPoint;
mActiveGrid = other.mActiveGrid;
mWorldUpdateRevision = other.mWorldUpdateRevision;
mNodes = other.mNodes;
}
void ViewData::add(QuadTreeNode* node)
{
unsigned int index = mNumEntries++;
if (index + 1 > mEntries.size())
mEntries.resize(index + 1);
ViewDataEntry& entry = mEntries[index];
if (entry.set(node))
{
mChanged = true;
mNodes.clear();
}
}
void ViewData::setViewPoint(const osg::Vec3f& viewPoint)
{
mViewPoint = viewPoint;
mHasViewPoint = true;
}
// NOTE: As a performance optimisation, we cache mRenderingNodes from previous frames here.
// If this cache becomes invalid (e.g. through mWorldUpdateRevision), we need to use clear() instead of reset().
void ViewData::reset()
{
// clear any unused entries
for (unsigned int i = mNumEntries; i < mEntries.size(); ++i)
mEntries[i].set(nullptr);
// reset index for next frame
mNumEntries = 0;
mChanged = false;
mNodes.clear();
}
void ViewData::clear()
{
for (unsigned int i = 0; i < mEntries.size(); ++i)
mEntries[i].set(nullptr);
mNumEntries = 0;
mLastUsageTimeStamp = 0;
mChanged = false;
mHasViewPoint = false;
mNodes.clear();
}
bool ViewData::suitableToUse(const osg::Vec4i& activeGrid) const
{
return hasViewPoint() && activeGrid == mActiveGrid && getNumEntries();
}
bool ViewData::contains(const QuadTreeNode* node) const
{
return std::binary_search(mNodes.begin(), mNodes.end(), node);
}
void ViewData::buildNodeIndex()
{
if (!mNodes.empty())
return;
mNodes.reserve(mNumEntries);
for (std::size_t i = 0; i < mNumEntries; ++i)
if (const QuadTreeNode* node = mEntries[i].mNode)
mNodes.push_back(node);
std::sort(mNodes.begin(), mNodes.end());
}
void ViewData::removeNodeFromIndex(const QuadTreeNode* node)
{
const auto it = std::lower_bound(mNodes.begin(), mNodes.end(), node);
if (it == mNodes.end() || *it != node)
return;
mNodes.erase(it);
}
ViewDataEntry::ViewDataEntry()
: mNode(nullptr)
, mLodFlags(0)
{
}
bool ViewDataEntry::set(QuadTreeNode* node)
{
if (node == mNode)
return false;
else
{
mNode = node;
// clear cached data
mRenderingNode = nullptr;
return true;
}
}
ViewData* ViewDataMap::getViewData(
osg::Object* viewer, const osg::Vec3f& viewPoint, const osg::Vec4i& activeGrid, bool& needsUpdate)
{
ViewerMap::const_iterator found = mViewers.find(viewer);
ViewData* vd = nullptr;
if (found == mViewers.end())
{
vd = createOrReuseView();
mViewers[viewer] = vd;
}
else
vd = found->second;
needsUpdate = false;
if (!(vd->suitableToUse(activeGrid)
&& (vd->getViewPoint() - viewPoint).length2() < mReuseDistance * mReuseDistance
&& vd->getWorldUpdateRevision() >= mWorldUpdateRevision))
{
float shortestDist = viewer ? mReuseDistance * mReuseDistance : std::numeric_limits<float>::max();
const ViewData* mostSuitableView = nullptr;
for (const ViewData* other : mUsedViews)
{
if (other->suitableToUse(activeGrid) && other->getWorldUpdateRevision() >= mWorldUpdateRevision)
{
float dist = (viewPoint - other->getViewPoint()).length2();
if (dist < shortestDist)
{
shortestDist = dist;
mostSuitableView = other;
}
}
}
if (mostSuitableView && mostSuitableView != vd)
{
vd->copyFrom(*mostSuitableView);
return vd;
}
else if (!mostSuitableView)
{
if (vd->getWorldUpdateRevision() != mWorldUpdateRevision)
{
vd->setWorldUpdateRevision(mWorldUpdateRevision);
vd->clear();
}
vd->setViewPoint(viewPoint);
vd->setActiveGrid(activeGrid);
needsUpdate = true;
}
}
return vd;
}
ViewData* ViewDataMap::createOrReuseView()
{
ViewData* vd = nullptr;
if (mUnusedViews.size())
{
vd = mUnusedViews.front();
mUnusedViews.pop_front();
}
else
{
mViewVector.emplace_back();
vd = &mViewVector.back();
}
mUsedViews.push_back(vd);
vd->setWorldUpdateRevision(mWorldUpdateRevision);
return vd;
}
ViewData* ViewDataMap::createIndependentView() const
{
ViewData* vd = new ViewData;
vd->setWorldUpdateRevision(mWorldUpdateRevision);
return vd;
}
void ViewDataMap::clearUnusedViews(double referenceTime)
{
for (ViewerMap::iterator it = mViewers.begin(); it != mViewers.end();)
{
if (it->second->getLastUsageTimeStamp() + mExpiryDelay < referenceTime)
mViewers.erase(it++);
else
++it;
}
for (std::deque<ViewData*>::iterator it = mUsedViews.begin(); it != mUsedViews.end();)
{
if ((*it)->getLastUsageTimeStamp() + mExpiryDelay < referenceTime)
{
(*it)->clear();
mUnusedViews.push_back(*it);
it = mUsedViews.erase(it);
}
else
++it;
}
}
void ViewDataMap::rebuildViews()
{
++mWorldUpdateRevision;
}
}
|
