2024-03-25 19:08:27 +00:00
|
|
|
#define_import_path bevy_pbr::meshlet_bindings
|
|
|
|
|
|
|
|
#import bevy_pbr::mesh_types::Mesh
|
|
|
|
#import bevy_render::view::View
|
|
|
|
|
|
|
|
struct PackedMeshletVertex {
|
|
|
|
a: vec4<f32>,
|
|
|
|
b: vec4<f32>,
|
|
|
|
tangent: vec4<f32>,
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: Octahedral encode normal, remove tangent and derive from UV derivatives
|
|
|
|
struct MeshletVertex {
|
|
|
|
position: vec3<f32>,
|
|
|
|
normal: vec3<f32>,
|
|
|
|
uv: vec2<f32>,
|
|
|
|
tangent: vec4<f32>,
|
|
|
|
}
|
|
|
|
|
|
|
|
fn unpack_meshlet_vertex(packed: PackedMeshletVertex) -> MeshletVertex {
|
|
|
|
var vertex: MeshletVertex;
|
|
|
|
vertex.position = packed.a.xyz;
|
|
|
|
vertex.normal = vec3(packed.a.w, packed.b.xy);
|
|
|
|
vertex.uv = packed.b.zw;
|
|
|
|
vertex.tangent = packed.tangent;
|
|
|
|
return vertex;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct Meshlet {
|
|
|
|
start_vertex_id: u32,
|
|
|
|
start_index_id: u32,
|
|
|
|
triangle_count: u32,
|
|
|
|
}
|
|
|
|
|
Meshlet continuous LOD (#12755)
Adds a basic level of detail system to meshlets. An extremely brief
summary is as follows:
* In `from_mesh.rs`, once we've built the first level of clusters, we
group clusters, simplify the new mega-clusters, and then split the
simplified groups back into regular sized clusters. Repeat several times
(ideally until you can't anymore). This forms a directed acyclic graph
(DAG), where the children are the meshlets from the previous level, and
the parents are the more simplified versions of their children. The leaf
nodes are meshlets formed from the original mesh.
* In `cull_meshlets.wgsl`, each cluster selects whether to render or not
based on the LOD bounding sphere (different than the culling bounding
sphere) of the current meshlet, the LOD bounding sphere of its parent
(the meshlet group from simplification), and the simplification error
relative to its children of both the current meshlet and its parent
meshlet. This kind of breaks two pass occlusion culling, which will be
fixed in a future PR by using an HZB from the previous frame to get the
initial list of occluders.
Many, _many_ improvements to be done in the future
https://github.com/bevyengine/bevy/issues/11518, not least of which is
code quality and speed. I don't even expect this to work on many types
of input meshes. This is just a basic implementation/draft for
collaboration.
Arguable how much we want to do in this PR, I'll leave that up to
maintainers. I've erred on the side of "as basic as possible".
References:
* Slides 27-77 (video available on youtube)
https://advances.realtimerendering.com/s2021/Karis_Nanite_SIGGRAPH_Advances_2021_final.pdf
*
https://blog.traverseresearch.nl/creating-a-directed-acyclic-graph-from-a-mesh-1329e57286e5
*
https://jglrxavpok.github.io/2024/01/19/recreating-nanite-lod-generation.html,
https://jglrxavpok.github.io/2024/03/12/recreating-nanite-faster-lod-generation.html,
https://jglrxavpok.github.io/2024/04/02/recreating-nanite-runtime-lod-selection.html,
and https://github.com/jglrxavpok/Carrot
*
https://github.com/gents83/INOX/tree/master/crates/plugins/binarizer/src
* https://cs418.cs.illinois.edu/website/text/nanite.html
![image](https://github.com/bevyengine/bevy/assets/47158642/e40bff9b-7d0c-4a19-a3cc-2aad24965977)
![image](https://github.com/bevyengine/bevy/assets/47158642/442c7da3-7761-4da7-9acd-37f15dd13e26)
---------
Co-authored-by: Ricky Taylor <rickytaylor26@gmail.com>
Co-authored-by: vero <email@atlasdostal.com>
Co-authored-by: François <mockersf@gmail.com>
Co-authored-by: atlas dostal <rodol@rivalrebels.com>
Co-authored-by: Patrick Walton <pcwalton@mimiga.net>
2024-04-23 21:43:53 +00:00
|
|
|
struct MeshletBoundingSpheres {
|
|
|
|
self_culling: MeshletBoundingSphere,
|
|
|
|
self_lod: MeshletBoundingSphere,
|
|
|
|
parent_lod: MeshletBoundingSphere,
|
|
|
|
}
|
|
|
|
|
2024-03-25 19:08:27 +00:00
|
|
|
struct MeshletBoundingSphere {
|
|
|
|
center: vec3<f32>,
|
|
|
|
radius: f32,
|
|
|
|
}
|
|
|
|
|
|
|
|
struct DrawIndirectArgs {
|
|
|
|
vertex_count: atomic<u32>,
|
|
|
|
instance_count: u32,
|
|
|
|
first_vertex: u32,
|
|
|
|
first_instance: u32,
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef MESHLET_CULLING_PASS
|
|
|
|
@group(0) @binding(0) var<storage, read> meshlet_thread_meshlet_ids: array<u32>; // Per cluster (instance of a meshlet)
|
Meshlet continuous LOD (#12755)
Adds a basic level of detail system to meshlets. An extremely brief
summary is as follows:
* In `from_mesh.rs`, once we've built the first level of clusters, we
group clusters, simplify the new mega-clusters, and then split the
simplified groups back into regular sized clusters. Repeat several times
(ideally until you can't anymore). This forms a directed acyclic graph
(DAG), where the children are the meshlets from the previous level, and
the parents are the more simplified versions of their children. The leaf
nodes are meshlets formed from the original mesh.
* In `cull_meshlets.wgsl`, each cluster selects whether to render or not
based on the LOD bounding sphere (different than the culling bounding
sphere) of the current meshlet, the LOD bounding sphere of its parent
(the meshlet group from simplification), and the simplification error
relative to its children of both the current meshlet and its parent
meshlet. This kind of breaks two pass occlusion culling, which will be
fixed in a future PR by using an HZB from the previous frame to get the
initial list of occluders.
Many, _many_ improvements to be done in the future
https://github.com/bevyengine/bevy/issues/11518, not least of which is
code quality and speed. I don't even expect this to work on many types
of input meshes. This is just a basic implementation/draft for
collaboration.
Arguable how much we want to do in this PR, I'll leave that up to
maintainers. I've erred on the side of "as basic as possible".
References:
* Slides 27-77 (video available on youtube)
https://advances.realtimerendering.com/s2021/Karis_Nanite_SIGGRAPH_Advances_2021_final.pdf
*
https://blog.traverseresearch.nl/creating-a-directed-acyclic-graph-from-a-mesh-1329e57286e5
*
https://jglrxavpok.github.io/2024/01/19/recreating-nanite-lod-generation.html,
https://jglrxavpok.github.io/2024/03/12/recreating-nanite-faster-lod-generation.html,
https://jglrxavpok.github.io/2024/04/02/recreating-nanite-runtime-lod-selection.html,
and https://github.com/jglrxavpok/Carrot
*
https://github.com/gents83/INOX/tree/master/crates/plugins/binarizer/src
* https://cs418.cs.illinois.edu/website/text/nanite.html
![image](https://github.com/bevyengine/bevy/assets/47158642/e40bff9b-7d0c-4a19-a3cc-2aad24965977)
![image](https://github.com/bevyengine/bevy/assets/47158642/442c7da3-7761-4da7-9acd-37f15dd13e26)
---------
Co-authored-by: Ricky Taylor <rickytaylor26@gmail.com>
Co-authored-by: vero <email@atlasdostal.com>
Co-authored-by: François <mockersf@gmail.com>
Co-authored-by: atlas dostal <rodol@rivalrebels.com>
Co-authored-by: Patrick Walton <pcwalton@mimiga.net>
2024-04-23 21:43:53 +00:00
|
|
|
@group(0) @binding(1) var<storage, read> meshlet_bounding_spheres: array<MeshletBoundingSpheres>; // Per asset meshlet
|
2024-03-25 19:08:27 +00:00
|
|
|
@group(0) @binding(2) var<storage, read> meshlet_thread_instance_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(3) var<storage, read> meshlet_instance_uniforms: array<Mesh>; // Per entity instance
|
|
|
|
@group(0) @binding(4) var<storage, read> meshlet_view_instance_visibility: array<u32>; // 1 bit per entity instance, packed as a bitmask
|
|
|
|
@group(0) @binding(5) var<storage, read_write> meshlet_occlusion: array<atomic<u32>>; // 1 bit per cluster (instance of a meshlet), packed as a bitmask
|
|
|
|
@group(0) @binding(6) var<storage, read> meshlet_previous_cluster_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(7) var<storage, read> meshlet_previous_occlusion: array<u32>; // 1 bit per cluster (instance of a meshlet), packed as a bitmask
|
|
|
|
@group(0) @binding(8) var<uniform> view: View;
|
|
|
|
@group(0) @binding(9) var depth_pyramid: texture_2d<f32>; // Generated from the first raster pass (unused in the first pass but still bound)
|
|
|
|
|
|
|
|
fn should_cull_instance(instance_id: u32) -> bool {
|
|
|
|
let bit_offset = instance_id % 32u;
|
|
|
|
let packed_visibility = meshlet_view_instance_visibility[instance_id / 32u];
|
|
|
|
return bool(extractBits(packed_visibility, bit_offset, 1u));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn get_meshlet_previous_occlusion(cluster_id: u32) -> bool {
|
|
|
|
let previous_cluster_id = meshlet_previous_cluster_ids[cluster_id];
|
|
|
|
let packed_occlusion = meshlet_previous_occlusion[previous_cluster_id / 32u];
|
|
|
|
let bit_offset = previous_cluster_id % 32u;
|
|
|
|
return bool(extractBits(packed_occlusion, bit_offset, 1u));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef MESHLET_WRITE_INDEX_BUFFER_PASS
|
|
|
|
@group(0) @binding(0) var<storage, read> meshlet_occlusion: array<u32>; // 1 bit per cluster (instance of a meshlet), packed as a bitmask
|
|
|
|
@group(0) @binding(1) var<storage, read> meshlet_thread_meshlet_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(2) var<storage, read> meshlet_previous_cluster_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(3) var<storage, read> meshlet_previous_occlusion: array<u32>; // 1 bit per cluster (instance of a meshlet), packed as a bitmask
|
|
|
|
@group(0) @binding(4) var<storage, read> meshlets: array<Meshlet>; // Per asset meshlet
|
|
|
|
@group(0) @binding(5) var<storage, read_write> draw_indirect_args: DrawIndirectArgs; // Single object shared between all workgroups/meshlets/triangles
|
|
|
|
@group(0) @binding(6) var<storage, read_write> draw_index_buffer: array<u32>; // Single object shared between all workgroups/meshlets/triangles
|
|
|
|
|
|
|
|
fn get_meshlet_occlusion(cluster_id: u32) -> bool {
|
|
|
|
let packed_occlusion = meshlet_occlusion[cluster_id / 32u];
|
|
|
|
let bit_offset = cluster_id % 32u;
|
|
|
|
return bool(extractBits(packed_occlusion, bit_offset, 1u));
|
|
|
|
}
|
|
|
|
|
|
|
|
fn get_meshlet_previous_occlusion(cluster_id: u32) -> bool {
|
|
|
|
let previous_cluster_id = meshlet_previous_cluster_ids[cluster_id];
|
|
|
|
let packed_occlusion = meshlet_previous_occlusion[previous_cluster_id / 32u];
|
|
|
|
let bit_offset = previous_cluster_id % 32u;
|
|
|
|
return bool(extractBits(packed_occlusion, bit_offset, 1u));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef MESHLET_VISIBILITY_BUFFER_RASTER_PASS
|
|
|
|
@group(0) @binding(0) var<storage, read> meshlet_thread_meshlet_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(1) var<storage, read> meshlets: array<Meshlet>; // Per asset meshlet
|
|
|
|
@group(0) @binding(2) var<storage, read> meshlet_indices: array<u32>; // Many per asset meshlet
|
|
|
|
@group(0) @binding(3) var<storage, read> meshlet_vertex_ids: array<u32>; // Many per asset meshlet
|
|
|
|
@group(0) @binding(4) var<storage, read> meshlet_vertex_data: array<PackedMeshletVertex>; // Many per asset meshlet
|
|
|
|
@group(0) @binding(5) var<storage, read> meshlet_thread_instance_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(0) @binding(6) var<storage, read> meshlet_instance_uniforms: array<Mesh>; // Per entity instance
|
|
|
|
@group(0) @binding(7) var<storage, read> meshlet_instance_material_ids: array<u32>; // Per entity instance
|
|
|
|
@group(0) @binding(8) var<storage, read> draw_index_buffer: array<u32>; // Single object shared between all workgroups/meshlets/triangles
|
|
|
|
@group(0) @binding(9) var<uniform> view: View;
|
|
|
|
|
|
|
|
fn get_meshlet_index(index_id: u32) -> u32 {
|
|
|
|
let packed_index = meshlet_indices[index_id / 4u];
|
|
|
|
let bit_offset = (index_id % 4u) * 8u;
|
|
|
|
return extractBits(packed_index, bit_offset, 8u);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef MESHLET_MESH_MATERIAL_PASS
|
|
|
|
@group(1) @binding(0) var meshlet_visibility_buffer: texture_2d<u32>; // Generated from the meshlet raster passes
|
|
|
|
@group(1) @binding(1) var<storage, read> meshlet_thread_meshlet_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(1) @binding(2) var<storage, read> meshlets: array<Meshlet>; // Per asset meshlet
|
|
|
|
@group(1) @binding(3) var<storage, read> meshlet_indices: array<u32>; // Many per asset meshlet
|
|
|
|
@group(1) @binding(4) var<storage, read> meshlet_vertex_ids: array<u32>; // Many per asset meshlet
|
|
|
|
@group(1) @binding(5) var<storage, read> meshlet_vertex_data: array<PackedMeshletVertex>; // Many per asset meshlet
|
|
|
|
@group(1) @binding(6) var<storage, read> meshlet_thread_instance_ids: array<u32>; // Per cluster (instance of a meshlet)
|
|
|
|
@group(1) @binding(7) var<storage, read> meshlet_instance_uniforms: array<Mesh>; // Per entity instance
|
|
|
|
|
|
|
|
fn get_meshlet_index(index_id: u32) -> u32 {
|
|
|
|
let packed_index = meshlet_indices[index_id / 4u];
|
|
|
|
let bit_offset = (index_id % 4u) * 8u;
|
|
|
|
return extractBits(packed_index, bit_offset, 8u);
|
|
|
|
}
|
|
|
|
#endif
|