bevy_meshem 0.4.0

A crate that offers a flexible and efficient way to generate meshes from a grid of Voxels
Documentation 
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

use crate::prelude::*;
use bevy::prelude::*;

/// This function will iron out any problems caused by generating two chunks that are adjacent to
/// each other seperatly. For example, it will cull the unneeded vertices between them, and fix
/// the proximity based shadowing.
/// reg: the Voxel Registry
/// main_mesh: the mesh to change
/// main_md: the metadata of the mesh to change
/// connection_side: from the POV of the main mesh, where is the adjacent mesh?
/// adjacent_chunk_grid: the grid of the chunk to introduce
pub fn introduce_adjacent_chunks<T: std::fmt::Debug + Sized + Copy>(
    reg: &impl VoxelRegistry<Voxel = T>,
    main_mesh: &mut Mesh,
    main_md: &mut MeshMD<T>,
    connection_side: Face,
    adjacent_chunk_grid: &[T],
) {
    assert_eq!(
        adjacent_chunk_grid.len(),
        main_md.vivi.vivi.len(),
        "Cannot introduce chunks with different sizes to each other"
    );
    let dims = main_md.dims;
    for index in iter_faces_of_chunk(dims, connection_side) {
        let adj_voxel_index = get_neigbhor_across_chunk_safe(dims, index, connection_side);
        let adj_voxel_index = if adj_voxel_index.is_some() {
            adj_voxel_index.unwrap()
        } else {
            continue;
        };

        let adj_voxel = adjacent_chunk_grid[adj_voxel_index];
        if reg.is_covering(&adj_voxel, connection_side.opposite()) {
            let mut tmp = [None; 6];
            tmp[connection_side as usize] = Some(adj_voxel);
            main_md.log(VoxelChange::CullFaces, index, adj_voxel, tmp)
        }
    }
    update_mesh(main_mesh, main_md, reg);
}