This greedy mesher is blazingly fast. Written with Rust and Bevy, using clever bitwise operations we can generate chunk meshes, an average of 0.000195 per 32x32x32 mesh!!!
This mesher blows most culled meshers out of the water, and I want to teach you the "secrets" of how to implement this for own voxel engine.
There are 2 algorithms we'll explore:
Binary greedy meshing AND binary face culling.

IT'S OPEN SOURCE!
https://github.com/TanTanDev/binary_g...

Resources:
Greedy Meshing Voxels Fast Optimism in Design Handmade Seattle 2022:    • Greedy Meshing Voxels Fast  Optimism...  
C++ binary greedy mesher repository: https://github.com/cgerikj/binarygre...
Simplified greedy mesher article: https://vercidium.com/blog/voxelworl...


My discord group:
  / discord  

Want to support me?
⁍ Patreon:   / tantandev  
⁍ Monero: 43Ktj1Bd4Nkaj4fdx6nPvBZkJewcPjxPB9nafnepM7SdGtcU6rhpxyLiV9w3k92rE1UqHTr4BNqe2ScsK1eEENvZDC3W1ur

0:00 blazingly fast
0:30 but why?
2:56 greedy meshing algorithm
4:23 indexing?
4:52 binary data
5:43 code: binary greedy meshing
7:44 chunk slicing
10:14 why it's slow
11:24 WORLDS FASTEST binary greedy mesher
19:43 why it's fast
21:01 interesting findings
22:22 resources

#rustlang #gamedev #programming