本文整理汇总了C++中Patch::Tessellate方法的典型用法代码示例。如果您正苦于以下问题：C++ Patch::Tessellate方法的具体用法？C++ Patch::Tessellate怎么用？C++ Patch::Tessellate使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Patch的用法示例。
在下文中一共展示了Patch::Tessellate方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: Tessellate
// ---------------------------------------------------------------------
// Create an approximate mesh of the landscape.
//
void CRoamMeshDrawer::Tessellate(const float3& campos, int viewradius)
{
// Perform Tessellation
#ifdef _OPENMP
// hint: just helps a little with huge cpu usage in retessellation, still better than nothing
// _____
// |0|_|_|..
// |_|_|_|..
// |_|_|8|..
// .....
// split the patches in 3x3 sized blocks. The tessellation itself can
// extend into the neighbor patches (check Patch::Split). So we could
// not multi-thread the whole loop w/o mutexes (in ::Split).
// But instead we take a safety distance between the thread's working
// area (which is 2 patches), so they don't conflict with each other.
for (int idx = 0; idx < 9; ++idx) {
#pragma omp parallel for
for (int i = m_Patches.size() - 1; i >= 0; --i) {
Patch* it = &m_Patches[i];
const int X = it->m_WorldX;
const int Z = it->m_WorldY;
const int subindex = (X % 3) + (Z % 3) * 3;
if ((subindex == idx) && it->IsVisible()) {
it->Tessellate(campos, viewradius);
}
}
}
#else
for (std::vector<Patch>::iterator it = m_Patches.begin(); it != m_Patches.end(); ++it) {
if (it->IsVisible())
it->Tessellate(campos, viewradius);
}
#endif
}示例2: Tessellate
// ---------------------------------------------------------------------
// Create an approximate mesh of the landscape.
//
bool CRoamMeshDrawer::Tessellate(const float3& campos, int viewradius)
{
// Perform Tessellation
// hint: threading just helps a little with huge cpu usage in retessellation, still better than nothing
// _____
// |0|_|_|..
// |_|_|_|..
// |_|_|8|..
// .....
// split the patches in 3x3 sized blocks. The tessellation itself can
// extend into the neighbor patches (check Patch::Split). So we could
// not multi-thread the whole loop w/o mutexes (in ::Split).
// But instead we take a safety distance between the thread's working
// area (which is 2 patches), so they don't conflict with each other.
bool forceTess = false;
for (int idx = 0; idx < 9; ++idx) {
for_mt(0, roamPatches.size(), [&](const int i){
Patch* it = &roamPatches[i];
const int X = it->m_WorldX;
const int Z = it->m_WorldY;
const int subindex = (X % 3) + (Z % 3) * 3;
if ((subindex == idx) && it->IsVisible()) {
if (!it->Tessellate(campos, viewradius))
forceTess = true;
}
});
if (forceTess)
return true;
}
return false;
}