feat: LOD 网格分级——meshopt 解析期简化 + 按距离/级联选级
vendored meshoptimizer 1.2(submodule 环境故障改直接 vendor)。Mesh 多 LOD:各级索引连续拼进同一 index buffer(共享顶点,LodRange 区间 选择),解析期 meshopt_simplify 生成链(LOD0=原始,每级目标减半, 相对误差 1e-2,小网格复用上级);都在 worker 线程,加载零额外卡顿。 SceneRenderer 按 (mesh, LOD) 聚合 batch(lookup key = 指针<<8|lod): 主视图按屏占比近似 radius/dist 选级(阈值 10/20 倍半径);阴影级联 按级联序降级(越远越简)。Draw 按 batch.lod 选索引区间。 A/B 对比(100 背包 10×10,RTX 5060 Laptop,vsync off): - 纯背包:LOD 开 93-95 fps / 关 90-107 fps —— 无显著差异 - 加 SunTemple:LOD 开 52-56 / 关 51-55 —— 无显著差异 结论:当前场景瓶颈不在顶点数(5060 顶点吞吐富余),LOD 基础设施 保留(几何复杂资产/低端 GPU/更大场景生效),帧率问题转向 Tracy GPU 时间线定位真实瓶颈。 坑:LodRange 记录"LOD 不足复用最后一级"时 first 不得继续累加 (buffer 无重复数据,累加必越界——VUID-08798 抓的)。
This commit is contained in:
@@ -17,13 +17,13 @@ namespace Engine
|
||||
{
|
||||
Mesh::Mesh(Device& device, MemoryAllocator& allocator,
|
||||
const std::vector<Vertex>& vertices,
|
||||
const std::vector<u32>& indices,
|
||||
const std::vector<std::vector<u32>>& lods,
|
||||
Material* material)
|
||||
: m_Material(material)
|
||||
{
|
||||
if (vertices.empty() || indices.empty())
|
||||
if (vertices.empty() || lods.empty() || lods[0].empty())
|
||||
{
|
||||
ENGINE_ERROR("Mesh: empty vertices or indices");
|
||||
ENGINE_ERROR("Mesh: empty vertices or LOD0 indices");
|
||||
return;
|
||||
}
|
||||
|
||||
@@ -35,15 +35,31 @@ namespace Engine
|
||||
vk::MemoryPropertyFlagBits::eHostCoherent);
|
||||
m_VertexBuffer->Upload(vertices.data(), vbSize);
|
||||
|
||||
u64 ibSize = sizeof(u32) * indices.size();
|
||||
// 各级索引连续拼进同一 index buffer(共享顶点,只换索引区间)
|
||||
std::vector<u32> allIndices;
|
||||
for (const auto& idx : lods) {
|
||||
allIndices.insert(allIndices.end(), idx.begin(), idx.end());
|
||||
}
|
||||
|
||||
u64 ibSize = sizeof(u32) * allIndices.size();
|
||||
m_IndexBuffer = CreateScope<Buffer>(
|
||||
device, allocator, ibSize,
|
||||
vk::BufferUsageFlagBits::eIndexBuffer,
|
||||
vk::MemoryPropertyFlagBits::eHostVisible |
|
||||
vk::MemoryPropertyFlagBits::eHostCoherent);
|
||||
m_IndexBuffer->Upload(indices.data(), ibSize);
|
||||
m_IndexBuffer->Upload(allIndices.data(), ibSize);
|
||||
|
||||
m_IndexCount = static_cast<u32>(indices.size());
|
||||
// 记录各级区间。LOD 不足的级复用最后一级的"已有区间"
|
||||
//(first 不得继续累加——buffer 里没有重复数据,累加必越界)
|
||||
u32 first = 0;
|
||||
for (u32 lod = 0; lod < kMeshLodCount; ++lod) {
|
||||
if (lod < lods.size()) {
|
||||
m_Lods[lod] = {first, static_cast<u32>(lods[lod].size())};
|
||||
first += m_Lods[lod].indexCount;
|
||||
} else {
|
||||
m_Lods[lod] = m_Lods[lods.size() - 1];
|
||||
}
|
||||
}
|
||||
|
||||
// 局部空间包围球:顶点包围盒 → 中心 + 最大半径(视锥剔除用)
|
||||
{
|
||||
@@ -61,10 +77,12 @@ namespace Engine
|
||||
}
|
||||
}
|
||||
|
||||
ENGINE_INFO("Mesh created: {} vertices, {} indices", vertices.size(), indices.size());
|
||||
ENGINE_INFO("Mesh created: {} vertices, LOD0 {} indices", vertices.size(), lods[0].size());
|
||||
|
||||
m_VertexBytes = sizeof(Vertex) * vertices.size();
|
||||
m_IndexBytes = sizeof(u32) * indices.size();
|
||||
for (const auto& idx : lods) {
|
||||
m_IndexBytes += sizeof(u32) * idx.size();
|
||||
}
|
||||
STATS.AddMesh(m_VertexBytes, m_IndexBytes);
|
||||
}
|
||||
|
||||
@@ -73,10 +91,14 @@ namespace Engine
|
||||
STATS.RemoveMesh(m_VertexBytes, m_IndexBytes);
|
||||
}
|
||||
|
||||
void Mesh::Draw(vk::CommandBuffer cmd, u32 instanceCount, u32 firstInstance) const
|
||||
void Mesh::Draw(vk::CommandBuffer cmd, u32 instanceCount, u32 firstInstance,
|
||||
u32 lod) const
|
||||
{
|
||||
const LodRange& range =
|
||||
m_Lods[lod < kMeshLodCount ? lod : kMeshLodCount - 1];
|
||||
cmd.bindVertexBuffers(0, m_VertexBuffer->Get(), {0});
|
||||
cmd.bindIndexBuffer(m_IndexBuffer->Get(), 0, vk::IndexType::eUint32);
|
||||
cmd.drawIndexed(m_IndexCount, instanceCount, 0, 0, firstInstance);
|
||||
cmd.drawIndexed(range.indexCount, instanceCount, range.firstIndex,
|
||||
0, firstInstance);
|
||||
}
|
||||
} // namespace Engine
|
||||
|
||||
Reference in New Issue
Block a user